{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:32CXQVWGWJZ24ZEEHJRPIGRBAG","short_pith_number":"pith:32CXQVWG","schema_version":"1.0","canonical_sha256":"de857856c6b273ae64843a62f41a210193b76e855bd96d8df70eb21006de6c65","source":{"kind":"arxiv","id":"2508.01935","version":1},"attestation_state":"computed","paper":{"title":"Edge open packing: further characterizations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arti Pandey, Kamal Santra","submitted_at":"2025-08-03T22:11:41Z","abstract_excerpt":"Let $G=(V, E)$ be a graph where $V(G)$ and $E(G)$ are the vertex and edge sets, respectively. In a graph $G$, two edges $e_1, e_2\\in E(G)$ are said to have \\emph{common edge} $e\\neq e_1, e_2$ if $e$ joins an endpoint of $e_1$ to an endpoint of $e_2$ in $G$. A subset $D\\subseteq E(G)$ is called an \\emph{edge open packing set} in $G$ if no two edges in $D$ share a common edge in $G$, and the largest size of such a set in $G$ is known as \\emph{edge open packing number}, represented by $\\rho_{e}^o(G)$. In the introductory paper (Chelladurai et al. (2022)), necessary and sufficient conditions for $"},"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":"2508.01935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-03T22:11:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0ccf87f64d0c080abbe985bb26b416d121ae66a1fd33d2a314f6a4494299a02f","abstract_canon_sha256":"d03cffb7b2745450caf7a9894d08224119f10b67c3c62dea596073c3cc19a384"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:48.547961Z","signature_b64":"Sgfku9TGRV/i1gvHo4vM9PkWLlcwEEihzE+s/OlT9dONEsMXLRTaPtwwntJdEUGqVODQxv5I6Q1rt7NFYGEeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de857856c6b273ae64843a62f41a210193b76e855bd96d8df70eb21006de6c65","last_reissued_at":"2026-07-05T11:47:48.547466Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:48.547466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge open packing: further characterizations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arti Pandey, Kamal Santra","submitted_at":"2025-08-03T22:11:41Z","abstract_excerpt":"Let $G=(V, E)$ be a graph where $V(G)$ and $E(G)$ are the vertex and edge sets, respectively. In a graph $G$, two edges $e_1, e_2\\in E(G)$ are said to have \\emph{common edge} $e\\neq e_1, e_2$ if $e$ joins an endpoint of $e_1$ to an endpoint of $e_2$ in $G$. A subset $D\\subseteq E(G)$ is called an \\emph{edge open packing set} in $G$ if no two edges in $D$ share a common edge in $G$, and the largest size of such a set in $G$ is known as \\emph{edge open packing number}, represented by $\\rho_{e}^o(G)$. In the introductory paper (Chelladurai et al. (2022)), necessary and sufficient conditions for $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01935","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.01935/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":"2508.01935","created_at":"2026-07-05T11:47:48.547529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01935v1","created_at":"2026-07-05T11:47:48.547529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01935","created_at":"2026-07-05T11:47:48.547529+00:00"},{"alias_kind":"pith_short_12","alias_value":"32CXQVWGWJZ2","created_at":"2026-07-05T11:47:48.547529+00:00"},{"alias_kind":"pith_short_16","alias_value":"32CXQVWGWJZ24ZEE","created_at":"2026-07-05T11:47:48.547529+00:00"},{"alias_kind":"pith_short_8","alias_value":"32CXQVWG","created_at":"2026-07-05T11:47:48.547529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28599","citing_title":"Algorithms for the Maximum Edge Open Packing Problem","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG","json":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG.json","graph_json":"https://pith.science/api/pith-number/32CXQVWGWJZ24ZEEHJRPIGRBAG/graph.json","events_json":"https://pith.science/api/pith-number/32CXQVWGWJZ24ZEEHJRPIGRBAG/events.json","paper":"https://pith.science/paper/32CXQVWG"},"agent_actions":{"view_html":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG","download_json":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG.json","view_paper":"https://pith.science/paper/32CXQVWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01935&json=true","fetch_graph":"https://pith.science/api/pith-number/32CXQVWGWJZ24ZEEHJRPIGRBAG/graph.json","fetch_events":"https://pith.science/api/pith-number/32CXQVWGWJZ24ZEEHJRPIGRBAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG/action/storage_attestation","attest_author":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG/action/author_attestation","sign_citation":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG/action/citation_signature","submit_replication":"https://pith.science/pith/32CXQVWGWJZ24ZEEHJRPIGRBAG/action/replication_record"}},"created_at":"2026-07-05T11:47:48.547529+00:00","updated_at":"2026-07-05T11:47:48.547529+00:00"}