{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YC7YRG7Q4JMK44WVQ76IGZUJEB","short_pith_number":"pith:YC7YRG7Q","schema_version":"1.0","canonical_sha256":"c0bf889bf0e258ae72d587fc836689204f31cdb92952b9c1274de841f0e80734","source":{"kind":"arxiv","id":"1505.02268","version":1},"attestation_state":"computed","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$ "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02268","created_at":"2026-05-18T02:16:19.368691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02268v1","created_at":"2026-05-18T02:16:19.368691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02268","created_at":"2026-05-18T02:16:19.368691+00:00"},{"alias_kind":"pith_short_12","alias_value":"YC7YRG7Q4JMK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YC7YRG7Q4JMK44WV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YC7YRG7Q","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB","json":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB.json","graph_json":"https://pith.science/api/pith-number/YC7YRG7Q4JMK44WVQ76IGZUJEB/graph.json","events_json":"https://pith.science/api/pith-number/YC7YRG7Q4JMK44WVQ76IGZUJEB/events.json","paper":"https://pith.science/paper/YC7YRG7Q"},"agent_actions":{"view_html":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB","download_json":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB.json","view_paper":"https://pith.science/paper/YC7YRG7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02268&json=true","fetch_graph":"https://pith.science/api/pith-number/YC7YRG7Q4JMK44WVQ76IGZUJEB/graph.json","fetch_events":"https://pith.science/api/pith-number/YC7YRG7Q4JMK44WVQ76IGZUJEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/action/storage_attestation","attest_author":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/action/author_attestation","sign_citation":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/action/citation_signature","submit_replication":"https://pith.science/pith/YC7YRG7Q4JMK44WVQ76IGZUJEB/action/replication_record"}},"created_at":"2026-05-18T02:16:19.368691+00:00","updated_at":"2026-05-18T02:16:19.368691+00:00"}