{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7PF7A524JMW5WMAW74ZXJFB3VE","short_pith_number":"pith:7PF7A524","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"},"canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","source":{"kind":"arxiv","id":"2510.16236","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.16236","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"2510.16236v3","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.16236","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"7PF7A524JMW5","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"7PF7A524JMW5WMAW","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"7PF7A524","created_at":"2026-07-30T01:19:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7PF7A524JMW5WMAW74ZXJFB3VE","target":"record","payload":{"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"},"canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","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"},"source_kind":"arxiv","source_id":"2510.16236","source_version":3,"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-07-30T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFVIiJ5fCptbVl2vYbCSNv1tnNo6YH43h6kjpRBXa8McgWgZp1clcMxxSGMAo5Jp4GuwJnZpCrf0nKy8tpyDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:29:20.980670Z"},"content_sha256":"f0417d2e15474f1cfbf792879ff2ef7052eebfee9ccabf1349aa5d4a47eaa5c6","schema_version":"1.0","event_id":"sha256:f0417d2e15474f1cfbf792879ff2ef7052eebfee9ccabf1349aa5d4a47eaa5c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7PF7A524JMW5WMAW74ZXJFB3VE","target":"graph","payload":{"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"},"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-07-30T01:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2xumn27SXw7FxrxhR/c//jCEh5LlgcIkkY7PT6iZiyAdHR+O1dMkwb4SU002+A5dujpl5U+22RXikE7fgrjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T17:29:20.981349Z"},"content_sha256":"e083b44b1168357a4da25eefc97306b31e8d35548d151f973a133cbb162be725","schema_version":"1.0","event_id":"sha256:e083b44b1168357a4da25eefc97306b31e8d35548d151f973a133cbb162be725"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/bundle.json","state_url":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PF7A524JMW5WMAW74ZXJFB3VE/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-08-20T17:29:20Z","links":{"resolver":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE","bundle":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/bundle.json","state":"https://pith.science/pith/7PF7A524JMW5WMAW74ZXJFB3VE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PF7A524JMW5WMAW74ZXJFB3VE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7PF7A524JMW5WMAW74ZXJFB3VE","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":"d0a1c0fb4264479d2e2c02fe9333a7ad4f235cb25ed2617e286a8f4dc0c20a7c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-17T21:56:17Z","title_canon_sha256":"638e5e632e55222eebf6739fc4f1af213edbe49ebb30f5296c6cebe62a17d498"},"schema_version":"1.0","source":{"id":"2510.16236","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.16236","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"2510.16236v3","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.16236","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"7PF7A524JMW5","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_16","alias_value":"7PF7A524JMW5WMAW","created_at":"2026-07-30T01:19:14Z"},{"alias_kind":"pith_short_8","alias_value":"7PF7A524","created_at":"2026-07-30T01:19:14Z"}],"graph_snapshots":[{"event_id":"sha256:e083b44b1168357a4da25eefc97306b31e8d35548d151f973a133cbb162be725","target":"graph","created_at":"2026-07-30T01:19:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.16236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kamal Santra","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-17T21:56:17Z","title":"Edge open packing on subclasses of chordal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.16236","kind":"arxiv","version":3},"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:f0417d2e15474f1cfbf792879ff2ef7052eebfee9ccabf1349aa5d4a47eaa5c6","target":"record","created_at":"2026-07-30T01:19:14Z","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":"d0a1c0fb4264479d2e2c02fe9333a7ad4f235cb25ed2617e286a8f4dc0c20a7c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-17T21:56:17Z","title_canon_sha256":"638e5e632e55222eebf6739fc4f1af213edbe49ebb30f5296c6cebe62a17d498"},"schema_version":"1.0","source":{"id":"2510.16236","kind":"arxiv","version":3}},"canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbcbf0775c4b2ddb3016ff3374943ba92b19438282470141a1136222ba89473a","first_computed_at":"2026-07-30T01:19:14.086320Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:19:14.086320Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2510.16236","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0417d2e15474f1cfbf792879ff2ef7052eebfee9ccabf1349aa5d4a47eaa5c6","sha256:e083b44b1168357a4da25eefc97306b31e8d35548d151f973a133cbb162be725"],"state_sha256":"e8cf808ada96e2c6a0615f49f88256933ed9c8ccec4c34d57845e09828fcd152"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn/phYX/ulc/jfJ7JfKNNcdP96KtnuoRlCq0LTB9MRoEYz5MqWjv3iaehFXF60jnjn3JxbXSDewIGDzrDVSUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T17:29:20.987471Z","bundle_sha256":"9fd73a49184754235cf7aee0fd2c0f5c84d6f5e66036dbe16470b445991c8ca5"}}