{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KBUY27YV43HQLKF6KF4ARBYNVO","short_pith_number":"pith:KBUY27YV","canonical_record":{"source":{"id":"1901.06534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-19T14:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"1eb4a490ef7d9fb1364ecf9cde1250e5e33930a7acf74ae262406dd190ef0202","abstract_canon_sha256":"e4a17087550181346fce79dba6f7b2a48b797e550aa1387858a28208ae191e5e"},"schema_version":"1.0"},"canonical_sha256":"50698d7f15e6cf05a8be517808870daba1d8ffef1b603341a302cbf3115e2c30","source":{"kind":"arxiv","id":"1901.06534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06534","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06534v2","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06534","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"KBUY27YV43HQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KBUY27YV43HQLKF6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KBUY27YV","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KBUY27YV43HQLKF6KF4ARBYNVO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-19T14:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"1eb4a490ef7d9fb1364ecf9cde1250e5e33930a7acf74ae262406dd190ef0202","abstract_canon_sha256":"e4a17087550181346fce79dba6f7b2a48b797e550aa1387858a28208ae191e5e"},"schema_version":"1.0"},"canonical_sha256":"50698d7f15e6cf05a8be517808870daba1d8ffef1b603341a302cbf3115e2c30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:33.618176Z","signature_b64":"TFl8HMFFmq5JMzBSk0EUDz9xunb+ytjO179ruSUlGcoHbSDYq5lWh2RISqX/PG3YwICrkc3WpMpQQji+z/GVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50698d7f15e6cf05a8be517808870daba1d8ffef1b603341a302cbf3115e2c30","last_reissued_at":"2026-05-17T23:40:33.617713Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:33.617713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06534","source_version":2,"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-17T23:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKmaDzvTvRkjJ4YiLUirEfd4CAzaNG5HyyhvyvIPfKnEBtF/REh4NpwZTpo+lJEu2hZh+I+o3Y+ep1bcu0i8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:00:44.198530Z"},"content_sha256":"d86c37065e4f19c04e65800cbbd44e1ab4ce6ef6253019acac4e4c6251a07698","schema_version":"1.0","event_id":"sha256:d86c37065e4f19c04e65800cbbd44e1ab4ce6ef6253019acac4e4c6251a07698"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KBUY27YV43HQLKF6KF4ARBYNVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed Intersection Representations and the Information Content of Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olgica Milenkovic, Roberto Machado, Xujun Liu","submitted_at":"2019-01-19T14:35:47Z","abstract_excerpt":"Consider a directed graph (digraph) in which vertices are assigned color sets, and two vertices are connected if and only if they share at least one color and the tail vertex has a strictly smaller color set than the head. We seek to determine the smallest possible size of the union of the color sets that allows for such a digraph representation. To address this problem, we introduce the new notion of a directed intersection representation of a digraph, and show that it is well-defined for all directed acyclic graphs (DAGs). We then proceed to introduce the directed intersection number (DIN), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06534","kind":"arxiv","version":2},"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-17T23:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5vMCsr/WDKrB15Uz7BFQGZJkmnjQFEQeH9OPesOEogdQLm+FyoUjkdmYsvSrYlpyKqeLvbgXMcmjDCr2X7zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:00:44.198869Z"},"content_sha256":"08de05a67faf6b063989c0f684664072198e4dbd7b734cd7bdfd10eeb755be14","schema_version":"1.0","event_id":"sha256:08de05a67faf6b063989c0f684664072198e4dbd7b734cd7bdfd10eeb755be14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBUY27YV43HQLKF6KF4ARBYNVO/bundle.json","state_url":"https://pith.science/pith/KBUY27YV43HQLKF6KF4ARBYNVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBUY27YV43HQLKF6KF4ARBYNVO/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-23T00:00:44Z","links":{"resolver":"https://pith.science/pith/KBUY27YV43HQLKF6KF4ARBYNVO","bundle":"https://pith.science/pith/KBUY27YV43HQLKF6KF4ARBYNVO/bundle.json","state":"https://pith.science/pith/KBUY27YV43HQLKF6KF4ARBYNVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBUY27YV43HQLKF6KF4ARBYNVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KBUY27YV43HQLKF6KF4ARBYNVO","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":"e4a17087550181346fce79dba6f7b2a48b797e550aa1387858a28208ae191e5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-19T14:35:47Z","title_canon_sha256":"1eb4a490ef7d9fb1364ecf9cde1250e5e33930a7acf74ae262406dd190ef0202"},"schema_version":"1.0","source":{"id":"1901.06534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06534","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06534v2","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06534","created_at":"2026-05-17T23:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"KBUY27YV43HQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KBUY27YV43HQLKF6","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KBUY27YV","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:08de05a67faf6b063989c0f684664072198e4dbd7b734cd7bdfd10eeb755be14","target":"graph","created_at":"2026-05-17T23:40:33Z","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":"Consider a directed graph (digraph) in which vertices are assigned color sets, and two vertices are connected if and only if they share at least one color and the tail vertex has a strictly smaller color set than the head. We seek to determine the smallest possible size of the union of the color sets that allows for such a digraph representation. To address this problem, we introduce the new notion of a directed intersection representation of a digraph, and show that it is well-defined for all directed acyclic graphs (DAGs). We then proceed to introduce the directed intersection number (DIN), ","authors_text":"Olgica Milenkovic, Roberto Machado, Xujun Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-19T14:35:47Z","title":"Directed Intersection Representations and the Information Content of Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06534","kind":"arxiv","version":2},"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:d86c37065e4f19c04e65800cbbd44e1ab4ce6ef6253019acac4e4c6251a07698","target":"record","created_at":"2026-05-17T23:40:33Z","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":"e4a17087550181346fce79dba6f7b2a48b797e550aa1387858a28208ae191e5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-19T14:35:47Z","title_canon_sha256":"1eb4a490ef7d9fb1364ecf9cde1250e5e33930a7acf74ae262406dd190ef0202"},"schema_version":"1.0","source":{"id":"1901.06534","kind":"arxiv","version":2}},"canonical_sha256":"50698d7f15e6cf05a8be517808870daba1d8ffef1b603341a302cbf3115e2c30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50698d7f15e6cf05a8be517808870daba1d8ffef1b603341a302cbf3115e2c30","first_computed_at":"2026-05-17T23:40:33.617713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:33.617713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TFl8HMFFmq5JMzBSk0EUDz9xunb+ytjO179ruSUlGcoHbSDYq5lWh2RISqX/PG3YwICrkc3WpMpQQji+z/GVDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:33.618176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d86c37065e4f19c04e65800cbbd44e1ab4ce6ef6253019acac4e4c6251a07698","sha256:08de05a67faf6b063989c0f684664072198e4dbd7b734cd7bdfd10eeb755be14"],"state_sha256":"cf4b5f5f5db6a12e543b0d842e68bb9837ee78ab3be2cb35fa51ac2cc0f5e1ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhMsxejigCKF7ujwHrbrreR72CdNA7QcLi4l9K+KDhscu9gAAbPxJVOLMumPLOqVh9XZKDfpbqUDV4vTalaiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:00:44.200781Z","bundle_sha256":"2f372dec464d456d9b75fed17b140c29433641d974bb0a5330396075dd5840e7"}}