{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4EMNBRDHCUFJ2W23HJOXA3OOW7","short_pith_number":"pith:4EMNBRDH","canonical_record":{"source":{"id":"1409.7795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-27T11:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"5708c25ea200ffe8a5e08aa81faaee335ff9e579a4dc1bf4e70ed36214bdab97","abstract_canon_sha256":"e5fa8ffe02b9be4468902176cf35b8ad7312489abce3c80359afe517d91cad53"},"schema_version":"1.0"},"canonical_sha256":"e118d0c467150a9d5b5b3a5d706dceb7c8919fa7e087d0bdb74ab817ce93f031","source":{"kind":"arxiv","id":"1409.7795","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7795","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7795v2","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7795","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"4EMNBRDHCUFJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4EMNBRDHCUFJ2W23","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4EMNBRDH","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4EMNBRDHCUFJ2W23HJOXA3OOW7","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-27T11:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"5708c25ea200ffe8a5e08aa81faaee335ff9e579a4dc1bf4e70ed36214bdab97","abstract_canon_sha256":"e5fa8ffe02b9be4468902176cf35b8ad7312489abce3c80359afe517d91cad53"},"schema_version":"1.0"},"canonical_sha256":"e118d0c467150a9d5b5b3a5d706dceb7c8919fa7e087d0bdb74ab817ce93f031","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.908226Z","signature_b64":"j6y/ZQY2txFG8ty3iE+lNRD5UYLowqlZiXh+Zmmcgd9nrD9J1gFTo3xsJ/ilm+aHvyGUGoGNqljesSKz6ouDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e118d0c467150a9d5b5b3a5d706dceb7c8919fa7e087d0bdb74ab817ce93f031","last_reissued_at":"2026-05-18T02:35:46.907843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.907843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7795","source_version":2,"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:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mX+D235PcibVW7jy6wen5ME/3BTtZXw+TK1ni3Evh48gG5VOYyNOgVQk+Hc4efeQn0T3D4ZFRzlLE9ixJrZ9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:23:18.957596Z"},"content_sha256":"818cd46d2812ecc857fca001fd7fde47725e4ed1adc4db3c3f47c6e6b47894b9","schema_version":"1.0","event_id":"sha256:818cd46d2812ecc857fca001fd7fde47725e4ed1adc4db3c3f47c6e6b47894b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4EMNBRDHCUFJ2W23HJOXA3OOW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of $r$-matchings in a Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Yeap Kang, Hiu-Fai Law, Jaehoon Kim, Younjin Kim","submitted_at":"2014-09-27T11:02:02Z","abstract_excerpt":"An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. A $2$-matching is also called an induced matching. In this paper, we estimate the maximum number of $r$-matchings in a tree of fixed order. We also prove that the $n$-vertex path has the maximum number of induced matchings among all $n$-vertex trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7795","kind":"arxiv","version":2},"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:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y7Q6ln3iI7aphAnGdktTGpvrmwADIQtlMTD1FHsG69uDK8PJLkLXsrrry0TlcPra8LgNNsmhvays/+sZRflmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:23:18.958211Z"},"content_sha256":"01f004672b3bdffdbbb7ed58ce98cb654b517734496646cbb0a677d5aa2148aa","schema_version":"1.0","event_id":"sha256:01f004672b3bdffdbbb7ed58ce98cb654b517734496646cbb0a677d5aa2148aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/bundle.json","state_url":"https://pith.science/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/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-10T18:23:18Z","links":{"resolver":"https://pith.science/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7","bundle":"https://pith.science/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/bundle.json","state":"https://pith.science/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EMNBRDHCUFJ2W23HJOXA3OOW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4EMNBRDHCUFJ2W23HJOXA3OOW7","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":"e5fa8ffe02b9be4468902176cf35b8ad7312489abce3c80359afe517d91cad53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-27T11:02:02Z","title_canon_sha256":"5708c25ea200ffe8a5e08aa81faaee335ff9e579a4dc1bf4e70ed36214bdab97"},"schema_version":"1.0","source":{"id":"1409.7795","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7795","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7795v2","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7795","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"4EMNBRDHCUFJ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4EMNBRDHCUFJ2W23","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4EMNBRDH","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:01f004672b3bdffdbbb7ed58ce98cb654b517734496646cbb0a677d5aa2148aa","target":"graph","created_at":"2026-05-18T02:35:46Z","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":"An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. A $2$-matching is also called an induced matching. In this paper, we estimate the maximum number of $r$-matchings in a tree of fixed order. We also prove that the $n$-vertex path has the maximum number of induced matchings among all $n$-vertex trees.","authors_text":"Dong Yeap Kang, Hiu-Fai Law, Jaehoon Kim, Younjin Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-27T11:02:02Z","title":"On the number of $r$-matchings in a Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7795","kind":"arxiv","version":2},"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:818cd46d2812ecc857fca001fd7fde47725e4ed1adc4db3c3f47c6e6b47894b9","target":"record","created_at":"2026-05-18T02:35:46Z","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":"e5fa8ffe02b9be4468902176cf35b8ad7312489abce3c80359afe517d91cad53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-27T11:02:02Z","title_canon_sha256":"5708c25ea200ffe8a5e08aa81faaee335ff9e579a4dc1bf4e70ed36214bdab97"},"schema_version":"1.0","source":{"id":"1409.7795","kind":"arxiv","version":2}},"canonical_sha256":"e118d0c467150a9d5b5b3a5d706dceb7c8919fa7e087d0bdb74ab817ce93f031","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e118d0c467150a9d5b5b3a5d706dceb7c8919fa7e087d0bdb74ab817ce93f031","first_computed_at":"2026-05-18T02:35:46.907843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.907843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j6y/ZQY2txFG8ty3iE+lNRD5UYLowqlZiXh+Zmmcgd9nrD9J1gFTo3xsJ/ilm+aHvyGUGoGNqljesSKz6ouDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.908226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7795","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:818cd46d2812ecc857fca001fd7fde47725e4ed1adc4db3c3f47c6e6b47894b9","sha256:01f004672b3bdffdbbb7ed58ce98cb654b517734496646cbb0a677d5aa2148aa"],"state_sha256":"7edf0318c8b80f11f278e7108690e609127a761326b1d262638cfd5efb596f70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9fKWz7uTYRZJZtOZSUnD7TcWL/UIth6zH3Qxd40tgDkJtlxH5l+5ZRe0nM8GMXOByMAZggKaY+XNZ65aXN0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:23:18.961729Z","bundle_sha256":"494c79fc71a3800b927dca06e897a0df9a7472b4b129df8985f1d984ae14e52f"}}