{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5CLTZZDEWOWGK4VHVLBSLAD563","short_pith_number":"pith:5CLTZZDE","schema_version":"1.0","canonical_sha256":"e8973ce464b3ac6572a7aac325807df6c386cf71c97a4f994f1bbeeedf1b1d41","source":{"kind":"arxiv","id":"2406.06982","version":2},"attestation_state":"computed","paper":{"title":"Open Packing in Graphs: Bounds and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"M. A. Shalu, V. K. Kirubakaran","submitted_at":"2024-06-11T06:25:41Z","abstract_excerpt":"Given a graph $G(V,E)$, a vertex subset $S$ of $G$ is called an open packing in $G$ if no pair of distinct vertices in $S$ have a common neighbour in $G$. The size of a largest open packing in $G$ is called the open packing number, $\\rho^o(G)$, of $G$. It would be interesting to note that the open packing number is a lower bound for the total domination number in graphs with no isolated vertices [Henning and Slater, 1999]. Given a graph $G$ and a positive integer $k$, the decision problem OPEN PACKING tests whether $G$ has an open packing of size at least $k$. The optimization problem MAX-OPEN"},"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":"2406.06982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-06-11T06:25:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b141dd96fa9667cd6c8944e7fc13c9ed5e6fead38e442e4739249ec18fd821b9","abstract_canon_sha256":"c789a3b2972317ab33e13f8fa579a662fae7b26e6d02fb4fe8bad3d77c7ba032"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:10.729725Z","signature_b64":"u7Xxi2OC0ihUnx4y3/6GBonPKNy0cIvJ7rQHmc7dyk64RPcAFvfTBsh1qrIdMkgWraLALrGfAcaVHYNfTiZhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8973ce464b3ac6572a7aac325807df6c386cf71c97a4f994f1bbeeedf1b1d41","last_reissued_at":"2026-07-05T08:43:10.729231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:10.729231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Open Packing in Graphs: Bounds and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"M. A. Shalu, V. K. Kirubakaran","submitted_at":"2024-06-11T06:25:41Z","abstract_excerpt":"Given a graph $G(V,E)$, a vertex subset $S$ of $G$ is called an open packing in $G$ if no pair of distinct vertices in $S$ have a common neighbour in $G$. The size of a largest open packing in $G$ is called the open packing number, $\\rho^o(G)$, of $G$. It would be interesting to note that the open packing number is a lower bound for the total domination number in graphs with no isolated vertices [Henning and Slater, 1999]. Given a graph $G$ and a positive integer $k$, the decision problem OPEN PACKING tests whether $G$ has an open packing of size at least $k$. The optimization problem MAX-OPEN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.06982","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.06982/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.06982","created_at":"2026-07-05T08:43:10.729289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.06982v2","created_at":"2026-07-05T08:43:10.729289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.06982","created_at":"2026-07-05T08:43:10.729289+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CLTZZDEWOWG","created_at":"2026-07-05T08:43:10.729289+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CLTZZDEWOWGK4VH","created_at":"2026-07-05T08:43:10.729289+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CLTZZDE","created_at":"2026-07-05T08:43:10.729289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04856","citing_title":"Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563","json":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563.json","graph_json":"https://pith.science/api/pith-number/5CLTZZDEWOWGK4VHVLBSLAD563/graph.json","events_json":"https://pith.science/api/pith-number/5CLTZZDEWOWGK4VHVLBSLAD563/events.json","paper":"https://pith.science/paper/5CLTZZDE"},"agent_actions":{"view_html":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563","download_json":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563.json","view_paper":"https://pith.science/paper/5CLTZZDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/5CLTZZDEWOWGK4VHVLBSLAD563/graph.json","fetch_events":"https://pith.science/api/pith-number/5CLTZZDEWOWGK4VHVLBSLAD563/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563/action/storage_attestation","attest_author":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563/action/author_attestation","sign_citation":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563/action/citation_signature","submit_replication":"https://pith.science/pith/5CLTZZDEWOWGK4VHVLBSLAD563/action/replication_record"}},"created_at":"2026-07-05T08:43:10.729289+00:00","updated_at":"2026-07-05T08:43:10.729289+00:00"}