{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FQNYFWW5KBWDWAVT74IUICTKWL","short_pith_number":"pith:FQNYFWW5","canonical_record":{"source":{"id":"1604.02908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T12:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"b06608c2b1dcb46e6688b3bb9435da965c1c459e60f28e50165a9edd105a15cb","abstract_canon_sha256":"42be065b79ecd7f3bbe3ea92f02f7cb4aae1ada2296e03d16af881d755e0c485"},"schema_version":"1.0"},"canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","source":{"kind":"arxiv","id":"1604.02908","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02908","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02908v2","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02908","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"FQNYFWW5KBWD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQNYFWW5KBWDWAVT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQNYFWW5","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FQNYFWW5KBWDWAVT74IUICTKWL","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T12:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"b06608c2b1dcb46e6688b3bb9435da965c1c459e60f28e50165a9edd105a15cb","abstract_canon_sha256":"42be065b79ecd7f3bbe3ea92f02f7cb4aae1ada2296e03d16af881d755e0c485"},"schema_version":"1.0"},"canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:24.050790Z","signature_b64":"byx8ubaPC8UT2j5f3PDz9xLf0zEOkZI3ubpjhdPgmy56LI0cIC36GcwJnevRwUBrpgYRFVA3nE03rFxM998BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","last_reissued_at":"2026-05-18T01:16:24.050275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:24.050275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02908","source_version":2,"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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lF/FalgNoGLjjDCmKu0oW4gZXa0e/i8vkmhAIh4yffj5koRT2oFd4mZpddxOBII+pc4+XWckPFGt1b9WAf6tAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:48.063434Z"},"content_sha256":"3fedd1a9cb37e413949f11054cfcca2e8724507a70f05c75055a8c31a2499915","schema_version":"1.0","event_id":"sha256:3fedd1a9cb37e413949f11054cfcca2e8724507a70f05c75055a8c31a2499915"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FQNYFWW5KBWDWAVT74IUICTKWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree-associated edge-reconstruction numbers of double-brooms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Meijie Ma, Tingting Zhou","submitted_at":"2016-04-11T12:11:04Z","abstract_excerpt":"An edge-deleted subgraph of a graph $G$ is an {\\it edge-card}. A {\\it decard} consists of an edge-card and the degree of the missing edge. The {\\it degree-associated edge-reconstruction number} of a graph $G$, denoted $\\dern(G)$, is the minimum number of decards that suffice to reconstruct $G$. The {\\it adversary degree-associated edge-reconstruction number} $\\adern(G)$ is the least $k$ such that every set of $k$ decards determines $G$. We determine these two parameters for all double-brooms. The answer is usually $1$ for $\\dern(G)$, and $2$ for $\\adern(G)$ when $G$ is double-broom. But there "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02908","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":""},"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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3upaolVCDsxCv3tk+v/TKzXsnt33vnGIdSQfJv8MpduIVkRDCHUCqkFEeFN4cKAs7CxlckcIHBWF0jfGE6ZXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:48.063832Z"},"content_sha256":"8a9178521f49a723d2f5f28f8ccbdd6a33980bef3818fcdcc5a24c708186fa20","schema_version":"1.0","event_id":"sha256:8a9178521f49a723d2f5f28f8ccbdd6a33980bef3818fcdcc5a24c708186fa20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/bundle.json","state_url":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQNYFWW5KBWDWAVT74IUICTKWL/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-27T02:10:48Z","links":{"resolver":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL","bundle":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/bundle.json","state":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQNYFWW5KBWDWAVT74IUICTKWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FQNYFWW5KBWDWAVT74IUICTKWL","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":"42be065b79ecd7f3bbe3ea92f02f7cb4aae1ada2296e03d16af881d755e0c485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T12:11:04Z","title_canon_sha256":"b06608c2b1dcb46e6688b3bb9435da965c1c459e60f28e50165a9edd105a15cb"},"schema_version":"1.0","source":{"id":"1604.02908","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02908","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02908v2","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02908","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"FQNYFWW5KBWD","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQNYFWW5KBWDWAVT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQNYFWW5","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:8a9178521f49a723d2f5f28f8ccbdd6a33980bef3818fcdcc5a24c708186fa20","target":"graph","created_at":"2026-05-18T01:16:24Z","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":"An edge-deleted subgraph of a graph $G$ is an {\\it edge-card}. A {\\it decard} consists of an edge-card and the degree of the missing edge. The {\\it degree-associated edge-reconstruction number} of a graph $G$, denoted $\\dern(G)$, is the minimum number of decards that suffice to reconstruct $G$. The {\\it adversary degree-associated edge-reconstruction number} $\\adern(G)$ is the least $k$ such that every set of $k$ decards determines $G$. We determine these two parameters for all double-brooms. The answer is usually $1$ for $\\dern(G)$, and $2$ for $\\adern(G)$ when $G$ is double-broom. But there ","authors_text":"Meijie Ma, Tingting Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T12:11:04Z","title":"Degree-associated edge-reconstruction numbers of double-brooms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02908","kind":"arxiv","version":2},"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:3fedd1a9cb37e413949f11054cfcca2e8724507a70f05c75055a8c31a2499915","target":"record","created_at":"2026-05-18T01:16:24Z","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":"42be065b79ecd7f3bbe3ea92f02f7cb4aae1ada2296e03d16af881d755e0c485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-11T12:11:04Z","title_canon_sha256":"b06608c2b1dcb46e6688b3bb9435da965c1c459e60f28e50165a9edd105a15cb"},"schema_version":"1.0","source":{"id":"1604.02908","kind":"arxiv","version":2}},"canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","first_computed_at":"2026-05-18T01:16:24.050275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:24.050275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byx8ubaPC8UT2j5f3PDz9xLf0zEOkZI3ubpjhdPgmy56LI0cIC36GcwJnevRwUBrpgYRFVA3nE03rFxM998BAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:24.050790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02908","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fedd1a9cb37e413949f11054cfcca2e8724507a70f05c75055a8c31a2499915","sha256:8a9178521f49a723d2f5f28f8ccbdd6a33980bef3818fcdcc5a24c708186fa20"],"state_sha256":"10bb2eb1de38da4f4d11f52e686af3d213373c2878e92a9a2befecbfc6afd725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTUEiWFddOPjlnC0e9Sg9qAzsP5qi8hBlYIIJNe2oy6KQqjOqeRyVv+gFQ1nGFSWMVO59g9/p1i0aqxlwvwtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:10:48.066227Z","bundle_sha256":"1a580857829f8ae0db5c114a6e57fcd33a39aba84170f5c6142afdb7e61de29c"}}