{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V4GMPZ6KTI7SCBZPC3C6UGSZRX","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":"a7c695b3c5f021e9482af4af8ca2e17cf058ba1d07d68359ce8de62a68cb7ab5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T11:06:22Z","title_canon_sha256":"ed874a714892e0f9d137e79aeaaaf8b86c7919327b7678e40549c40341264dcf"},"schema_version":"1.0","source":{"id":"1710.10076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10076","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10076v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10076","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"V4GMPZ6KTI7S","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V4GMPZ6KTI7SCBZP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V4GMPZ6K","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:a1d9c0f9a5cc82ff8d3e82201988c4ba212e1e112158938bdc5ebb3195fc495b","target":"graph","created_at":"2026-05-18T00:31:54Z","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":"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.","authors_text":"D. Rautenbach, M. F\\\"urst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T11:06:22Z","title":"A lower bound on the acyclic matching number of subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10076","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:4034938e33bfc0d709ffce3e13c906797709fdae5aec90d163251c7cc2622dc5","target":"record","created_at":"2026-05-18T00:31:54Z","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":"a7c695b3c5f021e9482af4af8ca2e17cf058ba1d07d68359ce8de62a68cb7ab5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-27T11:06:22Z","title_canon_sha256":"ed874a714892e0f9d137e79aeaaaf8b86c7919327b7678e40549c40341264dcf"},"schema_version":"1.0","source":{"id":"1710.10076","kind":"arxiv","version":1}},"canonical_sha256":"af0cc7e7ca9a3f21072f16c5ea1a598dff7b9714ef7aae56d8f4c1442f29c7ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af0cc7e7ca9a3f21072f16c5ea1a598dff7b9714ef7aae56d8f4c1442f29c7ec","first_computed_at":"2026-05-18T00:31:54.806245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:54.806245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I6huU5DUjeO95lwgH9V1O9a43+yDrz4X2YHBurV3KXrUWKxZ8Pe0PJfyciBIXFUG2ucTEQwbvNQKG0J+cNjFBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:54.806652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4034938e33bfc0d709ffce3e13c906797709fdae5aec90d163251c7cc2622dc5","sha256:a1d9c0f9a5cc82ff8d3e82201988c4ba212e1e112158938bdc5ebb3195fc495b"],"state_sha256":"ab048331810c60e40bd38391348dbee6e12c775cfc1bc6421bf1b8a29aeb23c5"}