{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HPBAFLWNB6XPK5B2LKQOJGWHVN","short_pith_number":"pith:HPBAFLWN","canonical_record":{"source":{"id":"1901.09859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T18:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"5dc4fbd08bffe845459ba449a2ff161800a47c9a63265f5166e1d6e1eb17f8f2","abstract_canon_sha256":"ada0186441361d517aa3e91b31cc8faadcff8021c5e9671a640ac8de2b656a70"},"schema_version":"1.0"},"canonical_sha256":"3bc202aecd0faef5743a5aa0e49ac7ab4a0ebc420732409bd6930799f6ce5eff","source":{"kind":"arxiv","id":"1901.09859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09859","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09859v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09859","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"HPBAFLWNB6XP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HPBAFLWNB6XPK5B2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HPBAFLWN","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HPBAFLWNB6XPK5B2LKQOJGWHVN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T18:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"5dc4fbd08bffe845459ba449a2ff161800a47c9a63265f5166e1d6e1eb17f8f2","abstract_canon_sha256":"ada0186441361d517aa3e91b31cc8faadcff8021c5e9671a640ac8de2b656a70"},"schema_version":"1.0"},"canonical_sha256":"3bc202aecd0faef5743a5aa0e49ac7ab4a0ebc420732409bd6930799f6ce5eff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:23.649114Z","signature_b64":"BZE3x1t3Vte/NgD4CjaZFGCwMlWnE5SwbBG+Oe6eX0KP+iqWH3+2MpEkgXXNKn/6nuxEZ+i7OBNCSo+pFZIFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bc202aecd0faef5743a5aa0e49ac7ab4a0ebc420732409bd6930799f6ce5eff","last_reissued_at":"2026-05-17T23:55:23.648634Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:23.648634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09859","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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7b4f+1lxk21izJtNZUmAaDOZ4kfjHIBk/NHRRR7vPv/K7n4sABt4v+8S0nmhTj2jEsOYm/4ZVjcUAjFxu75Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:55:44.324799Z"},"content_sha256":"e04e462dc0b5c191b5ea2f288f31196c38141defbb7b2e1412c4b8bb9ea7644a","schema_version":"1.0","event_id":"sha256:e04e462dc0b5c191b5ea2f288f31196c38141defbb7b2e1412c4b8bb9ea7644a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HPBAFLWNB6XPK5B2LKQOJGWHVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with a unique maximum open packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Douglas F. Rall, Kirsti Kuenzel","submitted_at":"2019-01-28T18:04:31Z","abstract_excerpt":"A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a unique maximum open packing. We characterize the trees with this property by using four local operations such that any nontrivial tree with a unique maximum open packing can be obtained by a sequence of these operations starting from $P_2$. We also prove that the decision version of the open packing number is NP-complete even when restricted to graphs of girth at least $6$. Finally, we show that the recognition of the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09859","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-17T23:55:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmOhDk9jkSXiNhsPf/5o9b+dWxNZ4WG8hlbrfNMpg+9d7Njw4Yaf3M3Q8+DjumKaSbhU4nSmLbnGy+qTH4dpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:55:44.325412Z"},"content_sha256":"1ef2c5485e7b5ab928e5d2a6259d7a7775194c5862a6c7f7c05d8573d0bf83e6","schema_version":"1.0","event_id":"sha256:1ef2c5485e7b5ab928e5d2a6259d7a7775194c5862a6c7f7c05d8573d0bf83e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/bundle.json","state_url":"https://pith.science/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/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-05-31T01:55:44Z","links":{"resolver":"https://pith.science/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN","bundle":"https://pith.science/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/bundle.json","state":"https://pith.science/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPBAFLWNB6XPK5B2LKQOJGWHVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HPBAFLWNB6XPK5B2LKQOJGWHVN","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":"ada0186441361d517aa3e91b31cc8faadcff8021c5e9671a640ac8de2b656a70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T18:04:31Z","title_canon_sha256":"5dc4fbd08bffe845459ba449a2ff161800a47c9a63265f5166e1d6e1eb17f8f2"},"schema_version":"1.0","source":{"id":"1901.09859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09859","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09859v1","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09859","created_at":"2026-05-17T23:55:23Z"},{"alias_kind":"pith_short_12","alias_value":"HPBAFLWNB6XP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HPBAFLWNB6XPK5B2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HPBAFLWN","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:1ef2c5485e7b5ab928e5d2a6259d7a7775194c5862a6c7f7c05d8573d0bf83e6","target":"graph","created_at":"2026-05-17T23:55:23Z","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":"A set $S$ of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in $S$ are disjoint. In this paper, we consider the graphs that have a unique maximum open packing. We characterize the trees with this property by using four local operations such that any nontrivial tree with a unique maximum open packing can be obtained by a sequence of these operations starting from $P_2$. We also prove that the decision version of the open packing number is NP-complete even when restricted to graphs of girth at least $6$. Finally, we show that the recognition of the gr","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Douglas F. Rall, Kirsti Kuenzel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T18:04:31Z","title":"Graphs with a unique maximum open packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09859","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:e04e462dc0b5c191b5ea2f288f31196c38141defbb7b2e1412c4b8bb9ea7644a","target":"record","created_at":"2026-05-17T23:55:23Z","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":"ada0186441361d517aa3e91b31cc8faadcff8021c5e9671a640ac8de2b656a70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-28T18:04:31Z","title_canon_sha256":"5dc4fbd08bffe845459ba449a2ff161800a47c9a63265f5166e1d6e1eb17f8f2"},"schema_version":"1.0","source":{"id":"1901.09859","kind":"arxiv","version":1}},"canonical_sha256":"3bc202aecd0faef5743a5aa0e49ac7ab4a0ebc420732409bd6930799f6ce5eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bc202aecd0faef5743a5aa0e49ac7ab4a0ebc420732409bd6930799f6ce5eff","first_computed_at":"2026-05-17T23:55:23.648634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:23.648634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZE3x1t3Vte/NgD4CjaZFGCwMlWnE5SwbBG+Oe6eX0KP+iqWH3+2MpEkgXXNKn/6nuxEZ+i7OBNCSo+pFZIFAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:23.649114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e04e462dc0b5c191b5ea2f288f31196c38141defbb7b2e1412c4b8bb9ea7644a","sha256:1ef2c5485e7b5ab928e5d2a6259d7a7775194c5862a6c7f7c05d8573d0bf83e6"],"state_sha256":"fb460f68ca5704010e6b0302c9822af5c07ff978edb8035179b03799d01619e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knBQHHFtroMFch8UiM8eBLJvqSc8BSJHi42edXYvXHR3PAscyy3gjoLXHJQQxixCEjN0oSsDOKOlqs682hsSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:55:44.328414Z","bundle_sha256":"b9b9d98de1e20699a2fd653e4335d60bed41fb53af9fcd2db22fda705c712e58"}}