{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HBHLFUHNX6W2BZGNS4PNYKDXOY","short_pith_number":"pith:HBHLFUHN","canonical_record":{"source":{"id":"1607.02911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-11T12:00:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3197ce08038c9f14e9a5f87438c02949f5ab851cdfcb6e3bdd0d8153cecba423","abstract_canon_sha256":"948a60001804aa0bf99e762bf0c8488548f86ac69345fd43d9853d848db3d5c4"},"schema_version":"1.0"},"canonical_sha256":"384eb2d0edbfada0e4cd971edc2877763b23435d449130cdea30ff5c9008a039","source":{"kind":"arxiv","id":"1607.02911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02911","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02911v1","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02911","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"pith_short_12","alias_value":"HBHLFUHNX6W2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HBHLFUHNX6W2BZGN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HBHLFUHN","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HBHLFUHNX6W2BZGNS4PNYKDXOY","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-11T12:00:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3197ce08038c9f14e9a5f87438c02949f5ab851cdfcb6e3bdd0d8153cecba423","abstract_canon_sha256":"948a60001804aa0bf99e762bf0c8488548f86ac69345fd43d9853d848db3d5c4"},"schema_version":"1.0"},"canonical_sha256":"384eb2d0edbfada0e4cd971edc2877763b23435d449130cdea30ff5c9008a039","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:14.404949Z","signature_b64":"w7ZIgnEjtCYm9Kpd2bQodLmSAA30hwO09DaeeSWcZJflaiiyeWlMZr6k3N/iiDAyM60bo8LbEHEX0pxo4LWICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"384eb2d0edbfada0e4cd971edc2877763b23435d449130cdea30ff5c9008a039","last_reissued_at":"2026-05-18T01:11:14.404535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:14.404535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02911","source_version":1,"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-18T01:11:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I38dSp8XvjwDiqvX3mWuTtIpGNADJ8N9OaHB8TXLvatsAho4A3Lai0dvFdmywKo8NGPsJWoyuI1cdcmj3EfDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:35:24.381693Z"},"content_sha256":"5085b2138865540f5d6a9892dc66b74ef8bc56f8f13a34d3ebef84e01e0b54bc","schema_version":"1.0","event_id":"sha256:5085b2138865540f5d6a9892dc66b74ef8bc56f8f13a34d3ebef84e01e0b54bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HBHLFUHNX6W2BZGNS4PNYKDXOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the atom graph of a graph and the union join graph of a hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Anne Berry, Genevi\\`eve Simonet","submitted_at":"2016-07-11T12:00:41Z","abstract_excerpt":"The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing this atom graph, with a complexity in $O(min(n^\\alpha \\log n, nm, n(n+\\overline{m}))$ time, which is no more than the complexity of computing the atoms in the general case. %\\par We extend our results to $\\alpha$-acyclic hypergraphs. We introduce the notion of union join graph, which is the union of all possible join trees; we apply our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02911","kind":"arxiv","version":1},"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-18T01:11:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugtfr8QJ6xK/mmnerCm4n4g2I5tJOg4X+zqf9HY5silyfLd7OOgLfFn6ipz6S4jtokK21BSnPlKtKdfRCP1OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:35:24.382032Z"},"content_sha256":"560e1099b6e9e9af44040b265c0469391d8845061d3845f1ff60a19660dd55d4","schema_version":"1.0","event_id":"sha256:560e1099b6e9e9af44040b265c0469391d8845061d3845f1ff60a19660dd55d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/bundle.json","state_url":"https://pith.science/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/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-06-09T12:35:24Z","links":{"resolver":"https://pith.science/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY","bundle":"https://pith.science/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/bundle.json","state":"https://pith.science/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBHLFUHNX6W2BZGNS4PNYKDXOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HBHLFUHNX6W2BZGNS4PNYKDXOY","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":"948a60001804aa0bf99e762bf0c8488548f86ac69345fd43d9853d848db3d5c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-11T12:00:41Z","title_canon_sha256":"3197ce08038c9f14e9a5f87438c02949f5ab851cdfcb6e3bdd0d8153cecba423"},"schema_version":"1.0","source":{"id":"1607.02911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02911","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02911v1","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02911","created_at":"2026-05-18T01:11:14Z"},{"alias_kind":"pith_short_12","alias_value":"HBHLFUHNX6W2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HBHLFUHNX6W2BZGN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HBHLFUHN","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:560e1099b6e9e9af44040b265c0469391d8845061d3845f1ff60a19660dd55d4","target":"graph","created_at":"2026-05-18T01:11:14Z","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":"The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing this atom graph, with a complexity in $O(min(n^\\alpha \\log n, nm, n(n+\\overline{m}))$ time, which is no more than the complexity of computing the atoms in the general case. %\\par We extend our results to $\\alpha$-acyclic hypergraphs. We introduce the notion of union join graph, which is the union of all possible join trees; we apply our algor","authors_text":"Anne Berry, Genevi\\`eve Simonet","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-11T12:00:41Z","title":"Computing the atom graph of a graph and the union join graph of a hypergraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02911","kind":"arxiv","version":1},"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:5085b2138865540f5d6a9892dc66b74ef8bc56f8f13a34d3ebef84e01e0b54bc","target":"record","created_at":"2026-05-18T01:11:14Z","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":"948a60001804aa0bf99e762bf0c8488548f86ac69345fd43d9853d848db3d5c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-11T12:00:41Z","title_canon_sha256":"3197ce08038c9f14e9a5f87438c02949f5ab851cdfcb6e3bdd0d8153cecba423"},"schema_version":"1.0","source":{"id":"1607.02911","kind":"arxiv","version":1}},"canonical_sha256":"384eb2d0edbfada0e4cd971edc2877763b23435d449130cdea30ff5c9008a039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"384eb2d0edbfada0e4cd971edc2877763b23435d449130cdea30ff5c9008a039","first_computed_at":"2026-05-18T01:11:14.404535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:14.404535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w7ZIgnEjtCYm9Kpd2bQodLmSAA30hwO09DaeeSWcZJflaiiyeWlMZr6k3N/iiDAyM60bo8LbEHEX0pxo4LWICg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:14.404949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5085b2138865540f5d6a9892dc66b74ef8bc56f8f13a34d3ebef84e01e0b54bc","sha256:560e1099b6e9e9af44040b265c0469391d8845061d3845f1ff60a19660dd55d4"],"state_sha256":"3bfe2f31b681b8fa65788e8897f1c98adc5a8127671fde17a53240e007f166d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9T6TtdYhwmoJ9L6LtDfXyBUKFzxOFAIXJuJkr7jazX4ZsX72VsieZVdZiW5n6lVZUAiqMwaHjnzyUTxt8y1bAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:35:24.383939Z","bundle_sha256":"db8643568236481d72afefb38ba16c2859b97b68fda850f7bc4635aaaa4be35b"}}