{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q7FAEW7ARGGM4AKULJVGULHN26","short_pith_number":"pith:Q7FAEW7A","canonical_record":{"source":{"id":"1602.04076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-02-01T18:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"c26c9fd0f6d6909b8967d828c88f4ca3e4b5ac4a535c3e5b239a90acb618c481","abstract_canon_sha256":"9843f30992b02b2b64634e0bbcd7eaf613a547487ccadde16855faf2cf7f939f"},"schema_version":"1.0"},"canonical_sha256":"87ca025be0898cce01545a6a6a2cedd791070597a878812fabcd65f05ce97cf4","source":{"kind":"arxiv","id":"1602.04076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04076","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04076v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04076","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q7FAEW7ARGGM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7FAEW7ARGGM4AKU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7FAEW7A","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q7FAEW7ARGGM4AKULJVGULHN26","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-02-01T18:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"c26c9fd0f6d6909b8967d828c88f4ca3e4b5ac4a535c3e5b239a90acb618c481","abstract_canon_sha256":"9843f30992b02b2b64634e0bbcd7eaf613a547487ccadde16855faf2cf7f939f"},"schema_version":"1.0"},"canonical_sha256":"87ca025be0898cce01545a6a6a2cedd791070597a878812fabcd65f05ce97cf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:54.666534Z","signature_b64":"hYDjRZauyAeXqrRJh+tVKsfW7IviTJ2CI05mzBgCNI5M3Phb15tYKkUtbJcD42rNybaH1WWB+skajQIcDjdwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87ca025be0898cce01545a6a6a2cedd791070597a878812fabcd65f05ce97cf4","last_reissued_at":"2026-05-18T01:20:54.665783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:54.665783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04076","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:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0fQJ2k10ZJ1LsPxOb1L1Bt2lbE9hC5kp+anKl2KZ2Qj6RLMaBQg8jZBuPV0uNPBcjEo8+t+RoBd+8OxxaqLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:28:34.755013Z"},"content_sha256":"cb447e78eb4cf823dccba822397dfd31e620ead60c4cceecc704969e4808afec","schema_version":"1.0","event_id":"sha256:cb447e78eb4cf823dccba822397dfd31e620ead60c4cceecc704969e4808afec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q7FAEW7ARGGM4AKULJVGULHN26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Labelling vertices to ensure adjacency coincides with disjointness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Mahipal Jadeja, Rahul Muthu, Sunitha V","submitted_at":"2016-02-01T18:09:26Z","abstract_excerpt":"Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes these sets are finite, but in many well known examples like geometric graphs (including interval graphs) they are infinite. One can also study the reverse problem of expressing the vertices of a given graph as distinct sets in such a way that adjacency coincides with intersection of the corresponding sets. The sets are usually required to conform to some te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04076","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:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wpqQaVAlsWTvlAvy1q5uRHKKHZY8DuP4eRqtdDdMnOXx/HrS4/AgdVyffI2QtCfbXUNK7oP+a20TS7a5kxqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:28:34.755377Z"},"content_sha256":"9e75740437c68d34494c729f52b5e6ee61beadbf5146cdbff7d4c094a408a094","schema_version":"1.0","event_id":"sha256:9e75740437c68d34494c729f52b5e6ee61beadbf5146cdbff7d4c094a408a094"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7FAEW7ARGGM4AKULJVGULHN26/bundle.json","state_url":"https://pith.science/pith/Q7FAEW7ARGGM4AKULJVGULHN26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7FAEW7ARGGM4AKULJVGULHN26/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-22T02:28:34Z","links":{"resolver":"https://pith.science/pith/Q7FAEW7ARGGM4AKULJVGULHN26","bundle":"https://pith.science/pith/Q7FAEW7ARGGM4AKULJVGULHN26/bundle.json","state":"https://pith.science/pith/Q7FAEW7ARGGM4AKULJVGULHN26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7FAEW7ARGGM4AKULJVGULHN26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q7FAEW7ARGGM4AKULJVGULHN26","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":"9843f30992b02b2b64634e0bbcd7eaf613a547487ccadde16855faf2cf7f939f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-02-01T18:09:26Z","title_canon_sha256":"c26c9fd0f6d6909b8967d828c88f4ca3e4b5ac4a535c3e5b239a90acb618c481"},"schema_version":"1.0","source":{"id":"1602.04076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04076","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04076v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04076","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"Q7FAEW7ARGGM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7FAEW7ARGGM4AKU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7FAEW7A","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:9e75740437c68d34494c729f52b5e6ee61beadbf5146cdbff7d4c094a408a094","target":"graph","created_at":"2026-05-18T01:20:54Z","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":"Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes these sets are finite, but in many well known examples like geometric graphs (including interval graphs) they are infinite. One can also study the reverse problem of expressing the vertices of a given graph as distinct sets in such a way that adjacency coincides with intersection of the corresponding sets. The sets are usually required to conform to some te","authors_text":"Mahipal Jadeja, Rahul Muthu, Sunitha V","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-02-01T18:09:26Z","title":"Labelling vertices to ensure adjacency coincides with disjointness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04076","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:cb447e78eb4cf823dccba822397dfd31e620ead60c4cceecc704969e4808afec","target":"record","created_at":"2026-05-18T01:20:54Z","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":"9843f30992b02b2b64634e0bbcd7eaf613a547487ccadde16855faf2cf7f939f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2016-02-01T18:09:26Z","title_canon_sha256":"c26c9fd0f6d6909b8967d828c88f4ca3e4b5ac4a535c3e5b239a90acb618c481"},"schema_version":"1.0","source":{"id":"1602.04076","kind":"arxiv","version":1}},"canonical_sha256":"87ca025be0898cce01545a6a6a2cedd791070597a878812fabcd65f05ce97cf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87ca025be0898cce01545a6a6a2cedd791070597a878812fabcd65f05ce97cf4","first_computed_at":"2026-05-18T01:20:54.665783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:54.665783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hYDjRZauyAeXqrRJh+tVKsfW7IviTJ2CI05mzBgCNI5M3Phb15tYKkUtbJcD42rNybaH1WWB+skajQIcDjdwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:54.666534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb447e78eb4cf823dccba822397dfd31e620ead60c4cceecc704969e4808afec","sha256:9e75740437c68d34494c729f52b5e6ee61beadbf5146cdbff7d4c094a408a094"],"state_sha256":"adff8b73832fc67b23f0d9311e210b2e8e52cea4d3af69d524579a4c39250557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGs/vI5RQ70lwvitAg51eziNZRKR5Z8exf3AK82jHrYwTQU2v2dpjpY8mu3VwDt28liBdLK/RQ1DoUDV+lEsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:28:34.757263Z","bundle_sha256":"027ef4c7a96517af693002e6f9ef21b11fdd68d7ae56e79038eead3e99d010d9"}}