{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MOVQFSLGLANENC6BD5L5IR5D6M","short_pith_number":"pith:MOVQFSLG","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"},"canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","source":{"kind":"arxiv","id":"1501.02488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02488","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02488v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02488","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"MOVQFSLGLANE","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MOVQFSLGLANENC6B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MOVQFSLG","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MOVQFSLGLANENC6BD5L5IR5D6M","target":"record","payload":{"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"},"canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","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"},"source_kind":"arxiv","source_id":"1501.02488","source_version":1,"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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnYNLXhJgoLqiukRfZWan8wAEWYaaeD9ENA6MI0aZKNjSDGmDZ/iDsivXxGx7bfpf+7Om5IxeKCXjy8UyFYoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:10:30.906837Z"},"content_sha256":"e01bb3f1b3bf5216c76dfd2213cf3d862c02ac913fbf428ca018de380f3b0178","schema_version":"1.0","event_id":"sha256:e01bb3f1b3bf5216c76dfd2213cf3d862c02ac913fbf428ca018de380f3b0178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MOVQFSLGLANENC6BD5L5IR5D6M","target":"graph","payload":{"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"},"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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mdEmbdmXRetyw/yZtLff5UkuKZcby/ec3E/ZcVUtqHjBPJqcaIbsYDoq8U2TrKrSM2pY1eDnNzT39kOKARrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:10:30.907530Z"},"content_sha256":"a190f07fb045cbbfa23bacbeb935f4ee699e6971424bcda0ed008c6fd18412dd","schema_version":"1.0","event_id":"sha256:a190f07fb045cbbfa23bacbeb935f4ee699e6971424bcda0ed008c6fd18412dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/bundle.json","state_url":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOVQFSLGLANENC6BD5L5IR5D6M/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-06T20:10:30Z","links":{"resolver":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M","bundle":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/bundle.json","state":"https://pith.science/pith/MOVQFSLGLANENC6BD5L5IR5D6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOVQFSLGLANENC6BD5L5IR5D6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MOVQFSLGLANENC6BD5L5IR5D6M","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":"18327cd8f3b431aef680439357d2ba53ba61e3dcae8b080674856b0bfc6384b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-11T19:15:00Z","title_canon_sha256":"891c32a43b9a1ce9e1ff2bc17aa92990d87c2ac9ef94fc0965cbb5cd5711046d"},"schema_version":"1.0","source":{"id":"1501.02488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02488","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02488v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02488","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"MOVQFSLGLANE","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MOVQFSLGLANENC6B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MOVQFSLG","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:a190f07fb045cbbfa23bacbeb935f4ee699e6971424bcda0ed008c6fd18412dd","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"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","authors_text":"Alexandr Kostochka, Andrew McConvey, Derrek Yager, Ervin Gy\\H{o}ri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-11T19:15:00Z","title":"A list version of graph packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02488","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:e01bb3f1b3bf5216c76dfd2213cf3d862c02ac913fbf428ca018de380f3b0178","target":"record","created_at":"2026-05-18T02:29:37Z","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":"18327cd8f3b431aef680439357d2ba53ba61e3dcae8b080674856b0bfc6384b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-11T19:15:00Z","title_canon_sha256":"891c32a43b9a1ce9e1ff2bc17aa92990d87c2ac9ef94fc0965cbb5cd5711046d"},"schema_version":"1.0","source":{"id":"1501.02488","kind":"arxiv","version":1}},"canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63ab02c966581a468bc11f57d447a3f31c5255e207c94ed6adaeb51a60d6b541","first_computed_at":"2026-05-18T02:29:37.841584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.841584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"clq9naDewwXK7tLE5AJVBMjlzKwf6o63f+K3sBjtcOmkXLNW7ZbFapL8UocsFQrrSBnLa4np2IaISrR44OdvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.841960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e01bb3f1b3bf5216c76dfd2213cf3d862c02ac913fbf428ca018de380f3b0178","sha256:a190f07fb045cbbfa23bacbeb935f4ee699e6971424bcda0ed008c6fd18412dd"],"state_sha256":"7538bd4998c9ca64d179feb07fd4faf083a2f367424bd3b03528751ff7c151d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hZok0ZxkpZD4x5zCaPpveW1tOtpXP+w6DX5U9IB//u0WNPUynUhiyTV19oz2IuGTon+tu43BBoDpYhTGBxNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:10:30.910914Z","bundle_sha256":"7a47885c74a74b758885b74cf912506fbe9a72452309e35888781daad323eb98"}}