{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y337ZMIBOD7INRNW4E55LDCXYK","short_pith_number":"pith:Y337ZMIB","schema_version":"1.0","canonical_sha256":"c6f7fcb10170fe86c5b6e13bd58c57c2ae57b2747de1f215c5124ef6ee995747","source":{"kind":"arxiv","id":"1805.03334","version":1},"attestation_state":"computed","paper":{"title":"$P$-Matchings in Graphs: A Brief Survey with Some Open Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renu Laskar, Soumendra Ganguly, Stephen Hedetniemi, Todd Fenstermacher","submitted_at":"2018-05-09T00:58:07Z","abstract_excerpt":"For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed."},"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":"1805.03334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-09T00:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"f67809050a4c4cbfaf7ad876ca2e25510e66c4b43e95d208ecd8a739ad332cf8","abstract_canon_sha256":"13c0b6c9e10bfbd9e66618c2379709fba820f46a8344cb2ce07d245e3429587b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.473648Z","signature_b64":"aemkYJlo2C6+2BEXsNhwk+4AX3vdCsAMHGjmj58wfrB6MC8DpatX38K+5mnjCTjCygOVlQXTspjj8Pb3ElP+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6f7fcb10170fe86c5b6e13bd58c57c2ae57b2747de1f215c5124ef6ee995747","last_reissued_at":"2026-05-18T00:16:20.473014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.473014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$P$-Matchings in Graphs: A Brief Survey with Some Open Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renu Laskar, Soumendra Ganguly, Stephen Hedetniemi, Todd Fenstermacher","submitted_at":"2018-05-09T00:58:07Z","abstract_excerpt":"For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03334","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":"1805.03334","created_at":"2026-05-18T00:16:20.473130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03334v1","created_at":"2026-05-18T00:16:20.473130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03334","created_at":"2026-05-18T00:16:20.473130+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y337ZMIBOD7I","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y337ZMIBOD7INRNW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y337ZMIB","created_at":"2026-05-18T12:33:04.347982+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/Y337ZMIBOD7INRNW4E55LDCXYK","json":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK.json","graph_json":"https://pith.science/api/pith-number/Y337ZMIBOD7INRNW4E55LDCXYK/graph.json","events_json":"https://pith.science/api/pith-number/Y337ZMIBOD7INRNW4E55LDCXYK/events.json","paper":"https://pith.science/paper/Y337ZMIB"},"agent_actions":{"view_html":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK","download_json":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK.json","view_paper":"https://pith.science/paper/Y337ZMIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03334&json=true","fetch_graph":"https://pith.science/api/pith-number/Y337ZMIBOD7INRNW4E55LDCXYK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y337ZMIBOD7INRNW4E55LDCXYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK/action/storage_attestation","attest_author":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK/action/author_attestation","sign_citation":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK/action/citation_signature","submit_replication":"https://pith.science/pith/Y337ZMIBOD7INRNW4E55LDCXYK/action/replication_record"}},"created_at":"2026-05-18T00:16:20.473130+00:00","updated_at":"2026-05-18T00:16:20.473130+00:00"}