{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:G4DCAQZXXWP6LRYKD4Y6SWJSGY","short_pith_number":"pith:G4DCAQZX","schema_version":"1.0","canonical_sha256":"3706204337bd9fe5c70a1f31e9593236221d1e225a708bb83b9345684ce96731","source":{"kind":"arxiv","id":"0810.4986","version":1},"attestation_state":"computed","paper":{"title":"Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Yeaw Ku, K. B. Wong","submitted_at":"2008-10-28T08:48:28Z","abstract_excerpt":"We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it."},"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":"0810.4986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-28T08:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"b11dae091433d39f50eea82a8b7ebe1329dc138c4dc15c429ed57b07e2846d51","abstract_canon_sha256":"75a6f14393b4d945f8e68a01c6977d6e84ec5b5c99a11f585dff86a7d5d4c75e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:28.438069Z","signature_b64":"3XdtqKtQxDHUJ3CdQrMNP95rlXSqg/1D44RH3wW0DW35VI9kNl5zvP1iNDKFG3cWoHrK1k/0gl+ULKcXBw9ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3706204337bd9fe5c70a1f31e9593236221d1e225a708bb83b9345684ce96731","last_reissued_at":"2026-05-18T04:28:28.437549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:28.437549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheng Yeaw Ku, K. B. Wong","submitted_at":"2008-10-28T08:48:28Z","abstract_excerpt":"We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4986","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":"0810.4986","created_at":"2026-05-18T04:28:28.437619+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4986v1","created_at":"2026-05-18T04:28:28.437619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4986","created_at":"2026-05-18T04:28:28.437619+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4DCAQZXXWP6","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4DCAQZXXWP6LRYK","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4DCAQZX","created_at":"2026-05-18T12:25:57.157939+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/G4DCAQZXXWP6LRYKD4Y6SWJSGY","json":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY.json","graph_json":"https://pith.science/api/pith-number/G4DCAQZXXWP6LRYKD4Y6SWJSGY/graph.json","events_json":"https://pith.science/api/pith-number/G4DCAQZXXWP6LRYKD4Y6SWJSGY/events.json","paper":"https://pith.science/paper/G4DCAQZX"},"agent_actions":{"view_html":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY","download_json":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY.json","view_paper":"https://pith.science/paper/G4DCAQZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4986&json=true","fetch_graph":"https://pith.science/api/pith-number/G4DCAQZXXWP6LRYKD4Y6SWJSGY/graph.json","fetch_events":"https://pith.science/api/pith-number/G4DCAQZXXWP6LRYKD4Y6SWJSGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY/action/storage_attestation","attest_author":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY/action/author_attestation","sign_citation":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY/action/citation_signature","submit_replication":"https://pith.science/pith/G4DCAQZXXWP6LRYKD4Y6SWJSGY/action/replication_record"}},"created_at":"2026-05-18T04:28:28.437619+00:00","updated_at":"2026-05-18T04:28:28.437619+00:00"}