{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MOVQFSLGLANENC6BD5L5IR5D6M","short_pith_number":"pith:MOVQFSLG","schema_version":"1.0","canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","source":{"kind":"arxiv","id":"1501.02488","version":1},"attestation_state":"computed","paper":{"title":"A list version of graph packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Andrew McConvey, Derrek Yager, Ervin Gy\\H{o}ri","submitted_at":"2015-01-11T19:15:00Z","abstract_excerpt":"We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \\cup V_{2}, E_{3})$ a bipartite graph. A bijection $f$ from $V_{1}$ onto $V_{2}$ is a list packing of the triple $(G_{1}, G_{2}, G_{3})$ if $uv \\in E_{2}$ implies $f(u)f(v) \\notin E_{2}$ and $vf(v) \\notin E_{3}$ for all $v \\in V_{1}$. We extend the classical results of Sauer and Spencer and Bollob\\'{a}s and Eldridge on packing of graphs with small sizes or maximum degrees to the setting of list packing. In particular, we extend the well"},"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":"1501.02488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-11T19:15:00Z","cross_cats_sorted":[],"title_canon_sha256":"891c32a43b9a1ce9e1ff2bc17aa92990d87c2ac9ef94fc0965cbb5cd5711046d","abstract_canon_sha256":"18327cd8f3b431aef680439357d2ba53ba61e3dcae8b080674856b0bfc6384b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.841960Z","signature_b64":"clq9naDewwXK7tLE5AJVBMjlzKwf6o63f+K3sBjtcOmkXLNW7ZbFapL8UocsFQrrSBnLa4np2IaISrR44OdvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","last_reissued_at":"2026-05-18T02:29:37.841584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.841584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A list version of graph packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Andrew McConvey, Derrek Yager, Ervin Gy\\H{o}ri","submitted_at":"2015-01-11T19:15:00Z","abstract_excerpt":"We consider the following generalization of graph packing. Let $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$ be graphs of order $n$ and $G_{3} = (V_{1} \\cup V_{2}, E_{3})$ a bipartite graph. A bijection $f$ from $V_{1}$ onto $V_{2}$ is a list packing of the triple $(G_{1}, G_{2}, G_{3})$ if $uv \\in E_{2}$ implies $f(u)f(v) \\notin E_{2}$ and $vf(v) \\notin E_{3}$ for all $v \\in V_{1}$. We extend the classical results of Sauer and Spencer and Bollob\\'{a}s and Eldridge on packing of graphs with small sizes or maximum degrees to the setting of list packing. In particular, we extend the well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02488","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":"1501.02488","created_at":"2026-05-18T02:29:37.841646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02488v1","created_at":"2026-05-18T02:29:37.841646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02488","created_at":"2026-05-18T02:29:37.841646+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOVQFSLGLANE","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOVQFSLGLANENC6B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOVQFSLG","created_at":"2026-05-18T12:29:32.376354+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/MOVQFSLGLANENC6BD5L5IR5D6M","json":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M.json","graph_json":"https://pith.science/api/pith-number/MOVQFSLGLANENC6BD5L5IR5D6M/graph.json","events_json":"https://pith.science/api/pith-number/MOVQFSLGLANENC6BD5L5IR5D6M/events.json","paper":"https://pith.science/paper/MOVQFSLG"},"agent_actions":{"view_html":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M","download_json":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M.json","view_paper":"https://pith.science/paper/MOVQFSLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02488&json=true","fetch_graph":"https://pith.science/api/pith-number/MOVQFSLGLANENC6BD5L5IR5D6M/graph.json","fetch_events":"https://pith.science/api/pith-number/MOVQFSLGLANENC6BD5L5IR5D6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/action/storage_attestation","attest_author":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/action/author_attestation","sign_citation":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/action/citation_signature","submit_replication":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/action/replication_record"}},"created_at":"2026-05-18T02:29:37.841646+00:00","updated_at":"2026-05-18T02:29:37.841646+00:00"}