{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YC7YRG7Q4JMK44WVQ76IGZUJEB","short_pith_number":"pith:YC7YRG7Q","canonical_record":{"source":{"id":"1505.02268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2015-05-09T13:22:07Z","cross_cats_sorted":[],"title_canon_sha256":"f8ecc9889441717b094d33b0777e403e6d1bd1c0149b6b65ca17e5ca9fb88ed4","abstract_canon_sha256":"8a36f7403fff91d91f571178979a315945abe04890a10a4c07256ee5d3b778ae"},"schema_version":"1.0"},"canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","source":{"kind":"arxiv","id":"1505.02268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02268","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02268v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02268","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"YC7YRG7Q4JMK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YC7YRG7Q4JMK44WV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YC7YRG7Q","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YC7YRG7Q4JMK44WVQ76IGZUJEB","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2015-05-09T13:22:07Z","cross_cats_sorted":[],"title_canon_sha256":"f8ecc9889441717b094d33b0777e403e6d1bd1c0149b6b65ca17e5ca9fb88ed4","abstract_canon_sha256":"8a36f7403fff91d91f571178979a315945abe04890a10a4c07256ee5d3b778ae"},"schema_version":"1.0"},"canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:19.369195Z","signature_b64":"RJqTI5+brFqH17eub9wUpa3y7EXdt+MdihS34uEvAfgavb1NZmWL+I1Ei6+GBZdLrbfUO5p4sV8ZL6vNfON9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","last_reissued_at":"2026-05-18T02:16:19.368611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:19.368611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02268","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihNzNq3u6G0cs8B2bDBZl5ctU7rO/RzjBB08lXwJJhZusg0lReaewbKRf1k4QQza3R9lNSmBgRfEE4jpbOL/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:48.536590Z"},"content_sha256":"8dd88c1eb9585fa227c22cd85465b36017d58e6543d2badae32e7f9c0d2e6d49","schema_version":"1.0","event_id":"sha256:8dd88c1eb9585fa227c22cd85465b36017d58e6543d2badae32e7f9c0d2e6d49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YC7YRG7Q4JMK44WVQ76IGZUJEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle Domination, Independence and Irredundance in graphs","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amy Grady, Drew J. Lipman, Fiona Knoll, Renu Laskar","submitted_at":"2015-05-09T13:22:07Z","abstract_excerpt":"A set $S$ of vertices in a graph $G = (V, E)$ is called {\\em cycle independent} if the induced subgraph $\\langle S\\rangle$ is acyclic, and called {\\em odd-cycle indepdendet} if $\\langle S\\rangle$ is bipartite. A set $S$ is {\\em cycle dominating} (resp. {\\em odd-cycle dominating}) if for every vertex $u \\in V \\setminus S$ there exists a vertex $v \\in S$ such that $u$ and $v$ are contained in a (resp. odd cycle) cycle in $\\langle S \\setminus \\{u\\}\\rangle$. A set $S$ is {\\em cycle irredundant} (resp. odd-cycle irredundant) if for every vertex $v \\in S$ there exists a vertex $u \\in V \\setminus S$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02268","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:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGz0RRVMnwZ1TnQvvTcPWl9vHFINCMc3BJfg+YOGlWaN2RVrWIoqhy0wBaakWmHTzLgOtwsAUg3XhB6oyoEjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:20:48.537225Z"},"content_sha256":"6c9eeeb1ea698e1bb1be1e8f5629b0f6d917d8ab348963489752d20d46adc592","schema_version":"1.0","event_id":"sha256:6c9eeeb1ea698e1bb1be1e8f5629b0f6d917d8ab348963489752d20d46adc592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/bundle.json","state_url":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/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-05-26T21:20:48Z","links":{"resolver":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB","bundle":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/bundle.json","state":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YC7YRG7Q4JMK44WVQ76IGZUJEB","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":"8a36f7403fff91d91f571178979a315945abe04890a10a4c07256ee5d3b778ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2015-05-09T13:22:07Z","title_canon_sha256":"f8ecc9889441717b094d33b0777e403e6d1bd1c0149b6b65ca17e5ca9fb88ed4"},"schema_version":"1.0","source":{"id":"1505.02268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02268","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02268v1","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02268","created_at":"2026-05-18T02:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"YC7YRG7Q4JMK","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YC7YRG7Q4JMK44WV","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YC7YRG7Q","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:6c9eeeb1ea698e1bb1be1e8f5629b0f6d917d8ab348963489752d20d46adc592","target":"graph","created_at":"2026-05-18T02:16:19Z","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 set $S$ of vertices in a graph $G = (V, E)$ is called {\\em cycle independent} if the induced subgraph $\\langle S\\rangle$ is acyclic, and called {\\em odd-cycle indepdendet} if $\\langle S\\rangle$ is bipartite. A set $S$ is {\\em cycle dominating} (resp. {\\em odd-cycle dominating}) if for every vertex $u \\in V \\setminus S$ there exists a vertex $v \\in S$ such that $u$ and $v$ are contained in a (resp. odd cycle) cycle in $\\langle S \\setminus \\{u\\}\\rangle$. A set $S$ is {\\em cycle irredundant} (resp. odd-cycle irredundant) if for every vertex $v \\in S$ there exists a vertex $u \\in V \\setminus S$ ","authors_text":"Amy Grady, Drew J. Lipman, Fiona Knoll, Renu Laskar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2015-05-09T13:22:07Z","title":"Cycle Domination, Independence and Irredundance in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02268","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:8dd88c1eb9585fa227c22cd85465b36017d58e6543d2badae32e7f9c0d2e6d49","target":"record","created_at":"2026-05-18T02:16:19Z","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":"8a36f7403fff91d91f571178979a315945abe04890a10a4c07256ee5d3b778ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2015-05-09T13:22:07Z","title_canon_sha256":"f8ecc9889441717b094d33b0777e403e6d1bd1c0149b6b65ca17e5ca9fb88ed4"},"schema_version":"1.0","source":{"id":"1505.02268","kind":"arxiv","version":1}},"canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","first_computed_at":"2026-05-18T02:16:19.368611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:19.368611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJqTI5+brFqH17eub9wUpa3y7EXdt+MdihS34uEvAfgavb1NZmWL+I1Ei6+GBZdLrbfUO5p4sV8ZL6vNfON9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:19.369195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dd88c1eb9585fa227c22cd85465b36017d58e6543d2badae32e7f9c0d2e6d49","sha256:6c9eeeb1ea698e1bb1be1e8f5629b0f6d917d8ab348963489752d20d46adc592"],"state_sha256":"3bd69f159cb5d42348a2352da7fdde90fb3c5cb1ddf05e7c3b08419d7b302962"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4t07vhVXz45kcGrFvMLHULVx9WizvcVbwD+rbb9zsRsedKy66JJ2E6Ov9GANv9fKuAnmZVM/9yEQ5EUCTUHiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:20:48.540692Z","bundle_sha256":"ac777d9bd37c5c1a25859537665e2294ba28b46a33423d8661100ac3cac38726"}}