{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TDOQFL7YECBF7HP7LOGRKWAOGH","short_pith_number":"pith:TDOQFL7Y","schema_version":"1.0","canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","source":{"kind":"arxiv","id":"1709.01155","version":3},"attestation_state":"computed","paper":{"title":"Intersection problem for Droms RAAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Zakharov, Enric Ventura, Jordi Delgado","submitted_at":"2017-09-04T21:09:44Z","abstract_excerpt":"We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether $H \\cap K$ is finitely generated or not, and, in the affirmative case, it computes a set of generators for $H \\cap K$. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian grou"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.01155","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-09-04T21:09:44Z","cross_cats_sorted":[],"title_canon_sha256":"0afcb009eba0cfd907eaffe2ce9579d557eaf1384f2102c1444f1d3fcbf6e372","abstract_canon_sha256":"9dd4699f9c995ed6abf61d91a9d22408109aec89c2522782dd252e7f0cdf5011"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:18.697506Z","signature_b64":"Dus6jt0K1i9Sqc96M5xEzDeBXL+1W4+yKlEpo+h6ivKzWhT0yFUIcQ9OCOVDRMwSyfDADBktUngpqVyro7dzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","last_reissued_at":"2026-05-18T00:11:18.696870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:18.696870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersection problem for Droms RAAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Zakharov, Enric Ventura, Jordi Delgado","submitted_at":"2017-09-04T21:09:44Z","abstract_excerpt":"We solve the subgroup intersection problem (SIP) for any RAAG G of Droms type (i.e., with defining graph not containing induced squares or paths of length 3): there is an algorithm which, given finite sets of generators for two subgroups H,K of G, decides whether $H \\cap K$ is finitely generated or not, and, in the affirmative case, it computes a set of generators for $H \\cap K$. Taking advantage of the recursive characterization of Droms groups, the proof consists in separately showing that the solvability of SIP passes through free products, and through direct products with free-abelian grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01155","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01155","created_at":"2026-05-18T00:11:18.696960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01155v3","created_at":"2026-05-18T00:11:18.696960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01155","created_at":"2026-05-18T00:11:18.696960+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDOQFL7YECBF","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDOQFL7YECBF7HP7","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDOQFL7Y","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH","json":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH.json","graph_json":"https://pith.science/api/pith-number/TDOQFL7YECBF7HP7LOGRKWAOGH/graph.json","events_json":"https://pith.science/api/pith-number/TDOQFL7YECBF7HP7LOGRKWAOGH/events.json","paper":"https://pith.science/paper/TDOQFL7Y"},"agent_actions":{"view_html":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH","download_json":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH.json","view_paper":"https://pith.science/paper/TDOQFL7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01155&json=true","fetch_graph":"https://pith.science/api/pith-number/TDOQFL7YECBF7HP7LOGRKWAOGH/graph.json","fetch_events":"https://pith.science/api/pith-number/TDOQFL7YECBF7HP7LOGRKWAOGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/action/storage_attestation","attest_author":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/action/author_attestation","sign_citation":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/action/citation_signature","submit_replication":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/action/replication_record"}},"created_at":"2026-05-18T00:11:18.696960+00:00","updated_at":"2026-05-18T00:11:18.696960+00:00"}