{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7PF7A524JMW5WMAW74ZXJFB3VE","short_pith_number":"pith:7PF7A524","schema_version":"1.0","canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","source":{"kind":"arxiv","id":"2510.16236","version":3},"attestation_state":"computed","paper":{"title":"Edge open packing on subclasses of chordal graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kamal Santra","submitted_at":"2025-10-17T21:56:17Z","abstract_excerpt":"Packing problems in graphs are fundamental in combinatorial optimization and arise naturally in applications such as resource allocation, scheduling, and communication networks. A classical example is the \\emph{induced matching} problem, where one seeks a set of edges whose endpoints induce a matching. In 2022, Chelladurai et al. introduced the notion of \\emph{edge open packing}, which can be viewed as a relaxation of induced matching: instead of forcing the selected edges to induce only isolated edges, edge open packing allows them to induce disjoint stars.\n  For a graph \\(G=(V,E)\\), two edge"},"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":"2510.16236","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-17T21:56:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"638e5e632e55222eebf6739fc4f1af213edbe49ebb30f5296c6cebe62a17d498","abstract_canon_sha256":"d0a1c0fb4264479d2e2c02fe9333a7ad4f235cb25ed2617e286a8f4dc0c20a7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","last_reissued_at":"2026-07-30T01:19:14.086320Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:19:14.086320Z"},"graph_snapshot":{"paper":{"title":"Edge open packing on subclasses of chordal graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kamal Santra","submitted_at":"2025-10-17T21:56:17Z","abstract_excerpt":"Packing problems in graphs are fundamental in combinatorial optimization and arise naturally in applications such as resource allocation, scheduling, and communication networks. A classical example is the \\emph{induced matching} problem, where one seeks a set of edges whose endpoints induce a matching. In 2022, Chelladurai et al. introduced the notion of \\emph{edge open packing}, which can be viewed as a relaxation of induced matching: instead of forcing the selected edges to induce only isolated edges, edge open packing allows them to induce disjoint stars.\n  For a graph \\(G=(V,E)\\), two edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.16236","kind":"arxiv","version":3},"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/2510.16236/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":"2510.16236","created_at":"2026-07-30T01:19:14.091529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.16236v3","created_at":"2026-07-30T01:19:14.091529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.16236","created_at":"2026-07-30T01:19:14.091529+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PF7A524JMW5","created_at":"2026-07-30T01:19:14.091529+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PF7A524JMW5WMAW","created_at":"2026-07-30T01:19:14.091529+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PF7A524","created_at":"2026-07-30T01:19:14.091529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.28599","citing_title":"Algorithms for the Maximum Edge Open Packing Problem","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE","json":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE.json","graph_json":"https://pith.science/api/pith-number/7PF7A524JMW5WMAW74ZXJFB3VE/graph.json","events_json":"https://pith.science/api/pith-number/7PF7A524JMW5WMAW74ZXJFB3VE/events.json","paper":"https://pith.science/paper/7PF7A524"},"agent_actions":{"view_html":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE","download_json":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE.json","view_paper":"https://pith.science/paper/7PF7A524","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.16236&json=true","fetch_graph":"https://pith.science/api/pith-number/7PF7A524JMW5WMAW74ZXJFB3VE/graph.json","fetch_events":"https://pith.science/api/pith-number/7PF7A524JMW5WMAW74ZXJFB3VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/action/storage_attestation","attest_author":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/action/author_attestation","sign_citation":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/action/citation_signature","submit_replication":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/action/replication_record"}},"created_at":"2026-07-30T01:19:14.091529+00:00","updated_at":"2026-07-30T01:19:14.091529+00:00"}