{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FQNYFWW5KBWDWAVT74IUICTKWL","short_pith_number":"pith:FQNYFWW5","schema_version":"1.0","canonical_sha256":"2c1b82dadd506c3b02b3ff11440a6ab2c1474c5825df1b16ff620f27addd0ad9","source":{"kind":"arxiv","id":"1604.02908","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.02908","created_at":"2026-05-18T01:16:24.050379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02908v2","created_at":"2026-05-18T01:16:24.050379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02908","created_at":"2026-05-18T01:16:24.050379+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQNYFWW5KBWD","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQNYFWW5KBWDWAVT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQNYFWW5","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL","json":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL.json","graph_json":"https://pith.science/api/pith-number/FQNYFWW5KBWDWAVT74IUICTKWL/graph.json","events_json":"https://pith.science/api/pith-number/FQNYFWW5KBWDWAVT74IUICTKWL/events.json","paper":"https://pith.science/paper/FQNYFWW5"},"agent_actions":{"view_html":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL","download_json":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL.json","view_paper":"https://pith.science/paper/FQNYFWW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02908&json=true","fetch_graph":"https://pith.science/api/pith-number/FQNYFWW5KBWDWAVT74IUICTKWL/graph.json","fetch_events":"https://pith.science/api/pith-number/FQNYFWW5KBWDWAVT74IUICTKWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/action/storage_attestation","attest_author":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/action/author_attestation","sign_citation":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/action/citation_signature","submit_replication":"https://pith.science/pith/FQNYFWW5KBWDWAVT74IUICTKWL/action/replication_record"}},"created_at":"2026-05-18T01:16:24.050379+00:00","updated_at":"2026-05-18T01:16:24.050379+00:00"}