{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5NMD3WA7G2ANNN37GQIIRCSAPB","short_pith_number":"pith:5NMD3WA7","canonical_record":{"source":{"id":"1207.7184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-31T08:41:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3bc76f34abeb3de401cce38c2e30cd98f7fbb2d352f564bcd3c2703aa5ac64ed","abstract_canon_sha256":"394d63e73d53c1b8465051ab40031da91f1e3945ce4bdd046db1dbea32344e96"},"schema_version":"1.0"},"canonical_sha256":"eb583dd81f3680d6b77f3410888a40786e0e32ffcd58da340cb82de4db1bfb43","source":{"kind":"arxiv","id":"1207.7184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7184","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7184v1","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7184","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"5NMD3WA7G2AN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5NMD3WA7G2ANNN37","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5NMD3WA7","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5NMD3WA7G2ANNN37GQIIRCSAPB","target":"record","payload":{"canonical_record":{"source":{"id":"1207.7184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-31T08:41:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"3bc76f34abeb3de401cce38c2e30cd98f7fbb2d352f564bcd3c2703aa5ac64ed","abstract_canon_sha256":"394d63e73d53c1b8465051ab40031da91f1e3945ce4bdd046db1dbea32344e96"},"schema_version":"1.0"},"canonical_sha256":"eb583dd81f3680d6b77f3410888a40786e0e32ffcd58da340cb82de4db1bfb43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:07.845514Z","signature_b64":"5uekwnDnAEoyrzzcuM6infumyHDkl9a3vcWM9VXCFzu2R7jSc5/8t5Jxe4MUgBeJXhPFP+1uNjGpZP07mYkbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb583dd81f3680d6b77f3410888a40786e0e32ffcd58da340cb82de4db1bfb43","last_reissued_at":"2026-05-18T02:21:07.844992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:07.844992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.7184","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-18T02:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oFwcAFb9LakZ7eSr9Z6oPf9rJNoiShwHGITmZw5WOiCBzyshYZa6bkJ/yba6Y51cfAqppQfepoRmJW7gR84Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:39:43.283903Z"},"content_sha256":"44a2671d08040b697e0208a534550db1837a39c221882c06ef7b654d2a8f187f","schema_version":"1.0","event_id":"sha256:44a2671d08040b697e0208a534550db1837a39c221882c06ef7b654d2a8f187f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5NMD3WA7G2ANNN37GQIIRCSAPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Set graphs. II. Complexity of set graph recognition and similar problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Alexandru I. Tomescu, Martin Milani\\v{c}, Romeo Rizzi","submitted_at":"2012-07-31T08:41:33Z","abstract_excerpt":"A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity aspects. We prove that set graph recognition is NP-complete, even when the input is restricted to bipartite graphs with exactly two leaves. The problem remains NP-complete if, in addition, we require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7184","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-18T02:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+bXIRfQWC4zcbVAl9BzcokyYyz2/Dqase2CaDzcELleYnic+/t5Oc+oHHL8jcagM/fNlMnLs9Qls24F8apYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:39:43.284616Z"},"content_sha256":"f7a1a53c51c9334cf3512acc0840c5013bb09401c03cc16f70f8a5d9e55b5826","schema_version":"1.0","event_id":"sha256:f7a1a53c51c9334cf3512acc0840c5013bb09401c03cc16f70f8a5d9e55b5826"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/bundle.json","state_url":"https://pith.science/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/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-01T03:39:43Z","links":{"resolver":"https://pith.science/pith/5NMD3WA7G2ANNN37GQIIRCSAPB","bundle":"https://pith.science/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/bundle.json","state":"https://pith.science/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NMD3WA7G2ANNN37GQIIRCSAPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5NMD3WA7G2ANNN37GQIIRCSAPB","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":"394d63e73d53c1b8465051ab40031da91f1e3945ce4bdd046db1dbea32344e96","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-31T08:41:33Z","title_canon_sha256":"3bc76f34abeb3de401cce38c2e30cd98f7fbb2d352f564bcd3c2703aa5ac64ed"},"schema_version":"1.0","source":{"id":"1207.7184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7184","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7184v1","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7184","created_at":"2026-05-18T02:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"5NMD3WA7G2AN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5NMD3WA7G2ANNN37","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5NMD3WA7","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:f7a1a53c51c9334cf3512acc0840c5013bb09401c03cc16f70f8a5d9e55b5826","target":"graph","created_at":"2026-05-18T02:21:07Z","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":"A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity aspects. We prove that set graph recognition is NP-complete, even when the input is restricted to bipartite graphs with exactly two leaves. The problem remains NP-complete if, in addition, we require","authors_text":"Alexandru I. Tomescu, Martin Milani\\v{c}, Romeo Rizzi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-31T08:41:33Z","title":"Set graphs. II. Complexity of set graph recognition and similar problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7184","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:44a2671d08040b697e0208a534550db1837a39c221882c06ef7b654d2a8f187f","target":"record","created_at":"2026-05-18T02:21:07Z","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":"394d63e73d53c1b8465051ab40031da91f1e3945ce4bdd046db1dbea32344e96","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-31T08:41:33Z","title_canon_sha256":"3bc76f34abeb3de401cce38c2e30cd98f7fbb2d352f564bcd3c2703aa5ac64ed"},"schema_version":"1.0","source":{"id":"1207.7184","kind":"arxiv","version":1}},"canonical_sha256":"eb583dd81f3680d6b77f3410888a40786e0e32ffcd58da340cb82de4db1bfb43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb583dd81f3680d6b77f3410888a40786e0e32ffcd58da340cb82de4db1bfb43","first_computed_at":"2026-05-18T02:21:07.844992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:07.844992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5uekwnDnAEoyrzzcuM6infumyHDkl9a3vcWM9VXCFzu2R7jSc5/8t5Jxe4MUgBeJXhPFP+1uNjGpZP07mYkbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:07.845514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.7184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a2671d08040b697e0208a534550db1837a39c221882c06ef7b654d2a8f187f","sha256:f7a1a53c51c9334cf3512acc0840c5013bb09401c03cc16f70f8a5d9e55b5826"],"state_sha256":"06cc0e586f8959707fc17a78d98a014e437af416aa5a5f44d291c4c35efab006"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcT4og5vwvqc/523OXCJrdlDMSJSd5n1/AYHSbL0TCFrpEdTB9yfEAgnqOAWHWrrYvSLqTOC4iHAv8oWLN0hAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:39:43.287917Z","bundle_sha256":"5618418edb708d2d2185113bb379e2988b7e80cf767a8a4a1d004c0f7b97898f"}}