{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RBRCMEAUIAARSFIDL6Y2WS2QT4","short_pith_number":"pith:RBRCMEAU","canonical_record":{"source":{"id":"1010.2464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T18:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"37d39645e6b2ef15a3896ef47329513a283f5f7f1bc69b248902eceef5b87098","abstract_canon_sha256":"f741a57c4a6b43a602b37c9adce568e905f8b440a1ad30a99238c6a46dc76529"},"schema_version":"1.0"},"canonical_sha256":"886226101440011915035fb1ab4b509f1ecdaa28ff0daa388a47717adc495e7c","source":{"kind":"arxiv","id":"1010.2464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2464","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2464v1","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2464","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"RBRCMEAUIAAR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RBRCMEAUIAARSFID","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RBRCMEAU","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RBRCMEAUIAARSFIDL6Y2WS2QT4","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T18:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"37d39645e6b2ef15a3896ef47329513a283f5f7f1bc69b248902eceef5b87098","abstract_canon_sha256":"f741a57c4a6b43a602b37c9adce568e905f8b440a1ad30a99238c6a46dc76529"},"schema_version":"1.0"},"canonical_sha256":"886226101440011915035fb1ab4b509f1ecdaa28ff0daa388a47717adc495e7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:27.953208Z","signature_b64":"3zQQn8Gb/IiueBdCFkHKgxsImBqA6/S/G8HDb+a+NHubyydvQ1quWj51yNZNVVeiA4rLvb6HqzRbc762tiE9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"886226101440011915035fb1ab4b509f1ecdaa28ff0daa388a47717adc495e7c","last_reissued_at":"2026-05-18T04:39:27.952719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:27.952719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2464","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-18T04:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5/eZL0OfswnNQvQU5X2bBbDnazhOnlDAflUnk7HRGulOiN3HuRjU+MFZuKsW/iA38G9bKpH+0vdAmcqDb12Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:16:31.584834Z"},"content_sha256":"63fb116af8594b5a3b624b53361b967ba68567599fcfdf221d212b26bbde89bc","schema_version":"1.0","event_id":"sha256:63fb116af8594b5a3b624b53361b967ba68567599fcfdf221d212b26bbde89bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RBRCMEAUIAARSFIDL6Y2WS2QT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Directed Domination in Oriented Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Yair Caro","submitted_at":"2010-10-12T18:35:13Z","abstract_excerpt":"A directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \\in V(D) \\setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by $\\gamma(D)$, is the minimum cardinality of a directed dominating set in $D$. The directed domination number of a graph $G$, denoted $\\Gamma_d(G)$, which is the maximum directed domination number $\\gamma(D)$ over all orientations $D$ of $G$. The directed domination number of a complete graph was first studied by Erd\\\"{o}s [Math. Gaz. 47 (1963), 220--222], alb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2464","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-18T04:39:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9StuJz54BYfzn9wHpb497H5AWMRL/Onz5/zAztGN1VjSGCpXhaBbLAcU/s4RuBGCmSOytxyVsALZ5RpYavMgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:16:31.585218Z"},"content_sha256":"bd2fa3d1b6826cc7b51a2f3e25c5b9a5bee72af22c633b164c847b147f94bd85","schema_version":"1.0","event_id":"sha256:bd2fa3d1b6826cc7b51a2f3e25c5b9a5bee72af22c633b164c847b147f94bd85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/bundle.json","state_url":"https://pith.science/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/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-11T06:16:31Z","links":{"resolver":"https://pith.science/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4","bundle":"https://pith.science/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/bundle.json","state":"https://pith.science/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBRCMEAUIAARSFIDL6Y2WS2QT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RBRCMEAUIAARSFIDL6Y2WS2QT4","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":"f741a57c4a6b43a602b37c9adce568e905f8b440a1ad30a99238c6a46dc76529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T18:35:13Z","title_canon_sha256":"37d39645e6b2ef15a3896ef47329513a283f5f7f1bc69b248902eceef5b87098"},"schema_version":"1.0","source":{"id":"1010.2464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2464","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2464v1","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2464","created_at":"2026-05-18T04:39:27Z"},{"alias_kind":"pith_short_12","alias_value":"RBRCMEAUIAAR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RBRCMEAUIAARSFID","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RBRCMEAU","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:bd2fa3d1b6826cc7b51a2f3e25c5b9a5bee72af22c633b164c847b147f94bd85","target":"graph","created_at":"2026-05-18T04:39:27Z","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 directed dominating set in a directed graph $D$ is a set $S$ of vertices of $V$ such that every vertex $u \\in V(D) \\setminus S$ has an adjacent vertex $v$ in $S$ with $v$ directed to $u$. The directed domination number of $D$, denoted by $\\gamma(D)$, is the minimum cardinality of a directed dominating set in $D$. The directed domination number of a graph $G$, denoted $\\Gamma_d(G)$, which is the maximum directed domination number $\\gamma(D)$ over all orientations $D$ of $G$. The directed domination number of a complete graph was first studied by Erd\\\"{o}s [Math. Gaz. 47 (1963), 220--222], alb","authors_text":"Michael A. Henning, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T18:35:13Z","title":"Directed Domination in Oriented Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2464","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:63fb116af8594b5a3b624b53361b967ba68567599fcfdf221d212b26bbde89bc","target":"record","created_at":"2026-05-18T04:39:27Z","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":"f741a57c4a6b43a602b37c9adce568e905f8b440a1ad30a99238c6a46dc76529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-12T18:35:13Z","title_canon_sha256":"37d39645e6b2ef15a3896ef47329513a283f5f7f1bc69b248902eceef5b87098"},"schema_version":"1.0","source":{"id":"1010.2464","kind":"arxiv","version":1}},"canonical_sha256":"886226101440011915035fb1ab4b509f1ecdaa28ff0daa388a47717adc495e7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"886226101440011915035fb1ab4b509f1ecdaa28ff0daa388a47717adc495e7c","first_computed_at":"2026-05-18T04:39:27.952719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:27.952719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3zQQn8Gb/IiueBdCFkHKgxsImBqA6/S/G8HDb+a+NHubyydvQ1quWj51yNZNVVeiA4rLvb6HqzRbc762tiE9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:27.953208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63fb116af8594b5a3b624b53361b967ba68567599fcfdf221d212b26bbde89bc","sha256:bd2fa3d1b6826cc7b51a2f3e25c5b9a5bee72af22c633b164c847b147f94bd85"],"state_sha256":"ea3b783d9acdc5ea7f0f34938e16fd90d48eb25fbed8978691f5e188a80bf811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/QV1To97xVPc/C6ydqO49MU1ftvcinlQcK0E600MgTkkkTal90ViF1wWWAR8TtRJ7MNWyReOjZI0050smPJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:16:31.588187Z","bundle_sha256":"86105134a08968077f53769fe6767849085ba534061985e0cd2e2d3557a6f7e4"}}