{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V4GMPZ6KTI7SCBZPC3C6UGSZRX","short_pith_number":"pith:V4GMPZ6K","schema_version":"1.0","canonical_sha256":"af0cc7e7ca9a3f21072f16c5ea1a598dff7b9714ef7aae56d8f4c1442f29c7ec","source":{"kind":"arxiv","id":"1710.10076","version":1},"attestation_state":"computed","paper":{"title":"A lower bound on the acyclic matching number of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2017-10-27T11:06:22Z","abstract_excerpt":"The acyclic matching number of a graph $G$ is the largest size of an acyclic matching in $G$, that is, a matching $M$ in $G$ such that the subgraph of $G$ induced by the vertices incident to an edge in $M$ is a forest. We show that the acyclic matching number of a connected subcubic graph $G$ with $m$ edges is at least $m/6$ except for two small exceptions."},"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":"1710.10076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T11:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"ed874a714892e0f9d137e79aeaaaf8b86c7919327b7678e40549c40341264dcf","abstract_canon_sha256":"a7c695b3c5f021e9482af4af8ca2e17cf058ba1d07d68359ce8de62a68cb7ab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.806652Z","signature_b64":"I6huU5DUjeO95lwgH9V1O9a43+yDrz4X2YHBurV3KXrUWKxZ8Pe0PJfyciBIXFUG2ucTEQwbvNQKG0J+cNjFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af0cc7e7ca9a3f21072f16c5ea1a598dff7b9714ef7aae56d8f4c1442f29c7ec","last_reissued_at":"2026-05-18T00:31:54.806245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.806245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on the acyclic matching number of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, M. F\\\"urst","submitted_at":"2017-10-27T11:06:22Z","abstract_excerpt":"The acyclic matching number of a graph $G$ is the largest size of an acyclic matching in $G$, that is, a matching $M$ in $G$ such that the subgraph of $G$ induced by the vertices incident to an edge in $M$ is a forest. We show that the acyclic matching number of a connected subcubic graph $G$ with $m$ edges is at least $m/6$ except for two small exceptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10076","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":"1710.10076","created_at":"2026-05-18T00:31:54.806308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10076v1","created_at":"2026-05-18T00:31:54.806308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10076","created_at":"2026-05-18T00:31:54.806308+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4GMPZ6KTI7S","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4GMPZ6KTI7SCBZP","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4GMPZ6K","created_at":"2026-05-18T12:31:49.984773+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/V4GMPZ6KTI7SCBZPC3C6UGSZRX","json":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX.json","graph_json":"https://pith.science/api/pith-number/V4GMPZ6KTI7SCBZPC3C6UGSZRX/graph.json","events_json":"https://pith.science/api/pith-number/V4GMPZ6KTI7SCBZPC3C6UGSZRX/events.json","paper":"https://pith.science/paper/V4GMPZ6K"},"agent_actions":{"view_html":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX","download_json":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX.json","view_paper":"https://pith.science/paper/V4GMPZ6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10076&json=true","fetch_graph":"https://pith.science/api/pith-number/V4GMPZ6KTI7SCBZPC3C6UGSZRX/graph.json","fetch_events":"https://pith.science/api/pith-number/V4GMPZ6KTI7SCBZPC3C6UGSZRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX/action/storage_attestation","attest_author":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX/action/author_attestation","sign_citation":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX/action/citation_signature","submit_replication":"https://pith.science/pith/V4GMPZ6KTI7SCBZPC3C6UGSZRX/action/replication_record"}},"created_at":"2026-05-18T00:31:54.806308+00:00","updated_at":"2026-05-18T00:31:54.806308+00:00"}