{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TDOQFL7YECBF7HP7LOGRKWAOGH","short_pith_number":"pith:TDOQFL7Y","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"},"canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","source":{"kind":"arxiv","id":"1709.01155","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01155","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01155v3","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01155","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"TDOQFL7YECBF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TDOQFL7YECBF7HP7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TDOQFL7Y","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TDOQFL7YECBF7HP7LOGRKWAOGH","target":"record","payload":{"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"},"canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","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"},"source_kind":"arxiv","source_id":"1709.01155","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JdjIzeMYXKV5zM5Kp/lvAb6egf/53hB/g1YTWkcqV+PEzyo0JWrQR3Nh5LoR9nIPgPQcWivmeyXJb9Ix5yY6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:22.099305Z"},"content_sha256":"57b39f95de69da32e9f43a093fdd612a10d33f72a5045eb04ea6aaecb718d0ca","schema_version":"1.0","event_id":"sha256:57b39f95de69da32e9f43a093fdd612a10d33f72a5045eb04ea6aaecb718d0ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TDOQFL7YECBF7HP7LOGRKWAOGH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8aIwbfuHzcGWqBg2UmZ4NnsLJb+mSlg3hENKa79WTngU9zwEBKSphsoU+uMDCXzqXz9vCKnpyxfb6R3fvzcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:33:22.099830Z"},"content_sha256":"b1811a7b8f52fa69061b529b2086f7450fd846aee560ecdfcfe42148589ded7f","schema_version":"1.0","event_id":"sha256:b1811a7b8f52fa69061b529b2086f7450fd846aee560ecdfcfe42148589ded7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/bundle.json","state_url":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:33:22Z","links":{"resolver":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH","bundle":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/bundle.json","state":"https://pith.science/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDOQFL7YECBF7HP7LOGRKWAOGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TDOQFL7YECBF7HP7LOGRKWAOGH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9dd4699f9c995ed6abf61d91a9d22408109aec89c2522782dd252e7f0cdf5011","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-09-04T21:09:44Z","title_canon_sha256":"0afcb009eba0cfd907eaffe2ce9579d557eaf1384f2102c1444f1d3fcbf6e372"},"schema_version":"1.0","source":{"id":"1709.01155","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01155","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01155v3","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01155","created_at":"2026-05-18T00:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"TDOQFL7YECBF","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TDOQFL7YECBF7HP7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TDOQFL7Y","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:b1811a7b8f52fa69061b529b2086f7450fd846aee560ecdfcfe42148589ded7f","target":"graph","created_at":"2026-05-18T00:11:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Zakharov, Enric Ventura, Jordi Delgado","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-09-04T21:09:44Z","title":"Intersection problem for Droms RAAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01155","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57b39f95de69da32e9f43a093fdd612a10d33f72a5045eb04ea6aaecb718d0ca","target":"record","created_at":"2026-05-18T00:11:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9dd4699f9c995ed6abf61d91a9d22408109aec89c2522782dd252e7f0cdf5011","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-09-04T21:09:44Z","title_canon_sha256":"0afcb009eba0cfd907eaffe2ce9579d557eaf1384f2102c1444f1d3fcbf6e372"},"schema_version":"1.0","source":{"id":"1709.01155","kind":"arxiv","version":3}},"canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98dd02aff820825f9dff5b8d15580e31c68161c657a0c0e09de79e5b8125ef46","first_computed_at":"2026-05-18T00:11:18.696870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:18.696870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dus6jt0K1i9Sqc96M5xEzDeBXL+1W4+yKlEpo+h6ivKzWhT0yFUIcQ9OCOVDRMwSyfDADBktUngpqVyro7dzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:18.697506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01155","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57b39f95de69da32e9f43a093fdd612a10d33f72a5045eb04ea6aaecb718d0ca","sha256:b1811a7b8f52fa69061b529b2086f7450fd846aee560ecdfcfe42148589ded7f"],"state_sha256":"9ec324ddc963cf2a77dc82109dbc8d27caf814442286354be8f47fde4a13b60f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bY0vV4Rp+IoeZfJTuAXSlzLrWqQTqB8nHcVkoEVHcF4ozmd+J5ZSFKGPNy+CSVwX4jqCUpWafKWw94D42LiqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:33:22.103152Z","bundle_sha256":"f34937d208e2dc6049b1191a1a2162f9de39de8c9caf2668c00ab678c8b5f7a5"}}